Question 6 [4 marks]. Consider the convex polygon described by the clockwise traversal of points below. (1, 1), (3, 3), (7,2), (5, 1) Using the construction given in the lecture slides, construct the LP for the largest-disk problem and convert that LP to standard form. Note that is not generally possible to represent this type of LP using rational numbers (since some of the Euclidean distance computations might require square roots). Therefore, for this question, represent all constants by decimal expansions with two decimal places (do not leave symbolic forms like square roots in the final answer). Since all vertices have non-negative coordinates, you may assume that the optimization variables of the LP (Ca, Cy and r) will always be positive (and therefore it is not necessary to perform any substitutions for unconstrained variables to put the LP into standard form). Question 6 [4 marks]. Consider the convex polygon described by the clockwise traversal of points below. (1, 1), (3, 3), (7,2), (5, 1) Using the construction given in the lecture slides, construct the LP for the largest-disk problem and convert that LP to standard form. Note that is not generally possible to represent this type of LP using rational numbers (since some of the Euclidean distance computations might require square roots). Therefore, for this question, represent all constants by decimal expansions with two decimal places (do not leave symbolic forms like square roots in the final answer). Since all vertices have non-negative coordinates, you may assume that the optimization variables of the LP (Ca, Cy and r) will always be positive (and therefore it is not necessary to perform any substitutions for unconstrained variables to put the LP into standard form)