a$.$ Determine the Minimum Vertex Cover for the following graph using an approximation

$[5]$

algorithm.

$4.$ Write a detailed algorithm for finding a Minimum Spanning Tree $($MST$)$ in a weighted,

$[5]$

connected graph. Include the key steps and necessary explanations for your algorithm.