Problem $5(20$pts$).$ Write a MATLAB$/$Python code to solve the vertex cover problem discussed in Lecture slides $1($the graph is in Figure $1).$ When you solve it$,$ use constraints $0$ xi $1$ rather than xi $\{0,1\}.$ What are the optimal solution and optimal value returned by CVX $($suppose we label the variables as xa$,...,$ xj $)?$ What is the optimal value of the true problem? So whether one can remove the integrality constraint when solving this problem?