$(10$ points$)$ Suppose we run the $DFS-$visit $(G,1)$ algorithm on the following directed graph $G$ given in its adjacency list representation where all the adjacency lists are sorted $($increasingly$).$ Classify all the edges of the graph $($i$.$e$.$ identify the tree edges, forwards edges, backward edges, and cross edges$).$