Hi there, I had a problem solving the following linear programming exercise, and would appreciate your help. Thanks!

We are given two positive numbers n and d and a function f : {0, 1, n) R. Our goal is to find the best approximation of f with a polynomial of degree d. More precisely we want to find a polynomial of degree d that minimizes max^eo.... ) - p(x) (a) (15 points) Formulate this problem as a linear program. (b) (10 points) Write the dual of your linear program. We are given two positive numbers n and d and a function f : {0, 1, n) R. Our goal is to find the best approximation of f with a polynomial of degree d. More precisely we want to find a polynomial of degree d that minimizes max^eo.... ) - p(x) (a) (15 points) Formulate this problem as a linear program. (b) (10 points) Write the dual of your linear program