Find the minimum spanning tree of the following graph as represented using an adjacency

matrix using both Breadth First Search and Depth First Search. Show all your working. The

starting node is coloured red in this matrix. The highlighted $0$s are the diagonal. Where you

need to$,$ follow alphabetical order$\left[\begin{array}{ccccccccc}0& 0& 0& 1& 0& 0& 0& 0& 0\\ 0& 0& 0& 1& 1& 0& 0& 0& 0\\ 0& 0& 0& 0& 1& 0& 0& 0& 0\\ 1& 1& 0& 0& 0& 0& 0& 1& 1\\ 0& 1& 1& 0& 0& 1& 1& 1& 0\\ 0& 0& 0& 0& 1& 0& 1& 0& 0\\ 0& 0& 0& 0& 1& 1& 0& 0& 0\\ 0& 0& 0& 1& 1& 0& 0& 0& 0\\ 0& 0& 0& 1& 0& 0& 0& 0& 0\end{array}\right]$