Q$2)$

a$)(20$ points$)$

Find the minimum spanning tree for the following network using the minimum spanning tree algorithm covered in class. Show each iteration of the algorithm.

b$)(30$ points$)$ Suppose that the following changes are made to the above network:

$d_{AB}=4($instead of $1)$ ; $d_{OC}=3($instead of $5)$; $d_{ET}=5($instead of $8)$

Find the minimum spanning tree for the updated network using the minimum spanning tree algorithm covered in class. Show each iteration of the algorithm.