a. Write pseudocode for a recursive algorithm to generate all possible Hamlitonian paths in a weighted graph with with n nodes, and choose the one with the smallest cost. In your answer, indicate what is passed in the recursive function, what processing is done, and what is returned finally.

b. Create a minimum spanning tree for the graph.

c. Draw K4 as a planar graph (so that no edges cross)