$1-8$ In the three minimum$-$cost spanning tree algorithms we discussed in class, which one keeps a single tree and expand it until the final tree is found? Which one select multiple edges at each pass? Are the spanning trees found by them exactly the same? What about the cost?

$($ANS$)$

$1-9$ The quicksort algorithm has the best average case complexity. Therefore, it is better to use it in all cases.

$($True$/$False$)$