Consider the graph in Fig. 6-28. (a) Find all the Hamilton circuits in the grap...

Consider the graph in Fig. 6-28.

(a) Find all the Hamilton circuits in the graph, using A asthe starting/ending vertex. You don’t have to list both acircuit and its reversal—you can just list one from eachpair.

(b) Find all the Hamilton paths that do not come from“broken” Hamilton circuits (i.e., cannot be closed intoa Hamilton circuit). You don’t have to list both a pathand its reversal—you can just list one from each pair.(Hint: Such paths must either start or end at C. You canjust list all the paths that start at C— the ones that endat C are their reversals.)