Give a trace of the breadth-first search algorithm when the input is the graph below and the start vertex is 5. Assume that the vertices are listed in increasing order in each adjacency linked list. Format your answer to show the current node, the contents of the queue, the contents of the visit array, the adjacency list with trav pointer at each iteration of the outer loop. Finally list the order in which the nodes were visited.