Question 6. [22 marks in total] a. (3 marks) Give a minimal vertex cover for the graph below 4 2 b. (3 marks) Below is the pseudocode from lectures for a 2-approximation algorithm for vertex cover of a graph G (V,E), C is the vertex cover produced by the algorithm. APPRox-VERTEX-COVER(G) C=0 while E'0 let (u,v) be an arbitrary edge of E' remove from E every edge incident on either u or v return C Assume that, when implemented, the process for selecting an arbitrary edge in APPRox- VERTEX-COVER is to choose that edge in E' (u, u) where the sum u+ u is the smallest Given this, what is the vertex cover C produced by this algorithm on the graph in a.? c. (13 marks) A proposed randomised p-approximation algorithm for vertex cover is as follows