Questions $(10)$ through $(13)$ pertain to the following graph:

Starting from vertex $($or node$)$ B$,$ which Hamiltonian circuit is produced using the Nearest$-$Neighbor

Algorithm?

$($a$)BCDEAB$

$($b$)BCAEDB$

$($c$)BACEDB$

$($d$)BCEDAB$

What is the total cost of the Hamiltonian circuit produced in the previous problem $($Problem $10)?$

$($a$)42$

$($c$)30$

$($b$)36$

$($d$)58$

Which Hamiltonian circuit is produced using the Sorted$-$Edges $($or Cheapest$-$Link$)$ Algorithm? The edge

lengths of this graph, sorted from shortest to longest, are

$2,4,6,6,8,10,10,12,14,16$

$($a$)ACBDEA$

$($b$)ACDEBA$

$($c$)ACDBEA$

$($d$)ACEDBA$

What is the total cost of the Hamiltonian circuit produced in the previous problem $($Problem $12)?$

$($a$)36$

$($c$)30$

$($b$)40$

$($d$)54$