# Solve a linear program in \$O(m^2)\$

Given $$max(c_1x_1+c_2x_2)$$ s.t $$a_1x_1+b_1x_2\le d_1$$ $$…$$ $$a_mx_1+b_mx_2\le d_m$$ $$x_1,x_2\ge0$$

I need to find an algorithm that solves this in $$O(m^2)$$. I’ve been trying to solve this for quite some time but no luck. Any idea?