For the following problems, consider the weighted graph $G_1$ shown below:

$6.$ Using a greedy algorithm $-$ starting at $B$ or $K$ and iteratively following the lightest available edge to the next vertex $-$ try to find a vertex$-$covering cycle in $G_1$ with small weight. Describe your process, not just the end result.

$7.$ Using a cheapest$-$link algorithm $-$ allocating the lightest available edge at each step $-$ try to find a vertex$-$covering cycle in $G_1$ with small weight. Describe your process, not just the end result.