Label the vertices (1,2,3,12) on the graph (on the right) in the order that you would visit them in depth first search STARTING FROM A. If there is a tie for the next vertex - use alphabetical order. (ii) Provide a list of the vertices in order of depth first search starting with A below: iii) Use the results from depth-first search to assign directions to the edges that makes the graph a strongly connected directed graph. Draw the arrows on the graph itself on the right. (iv) Write the vertices in a directed path from L to K : L