$(1)$ Complete the insertion sort algorithm.

;$j-$

$(2)$ The depth first traversal result starting from node A of the following graph

represented by adjacency matrix is