PLs show all work

(a) Determine if the following algorithm terminates. If so, prove this using the potential method as shown in lecture. If not, describe an input that would cause the algorithm to run forever. (b) Run the algorithm on the following graph and compute the value of the potential function you generated for each iteration of the line 6 (the while loop). For line 4 , choose A to be the arbitrary vertex. For line 8 , start from the lexicographically smallest node if there is a choice of at least two nodes