Using both Breadth First Search and Depth First Search, find the minimal spanning tree of the following graph as shown by an adjacency matrix. the start point second row as its red in image

$\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]$