LOOK AT THE PICTURE. you guys have already answered my question but you guys dont look at my picture and answer wrong. Construct the DFS tree T$\_1$ and BFS tree T$\_2.$ for G when starting in vertex $5.$ Assume that each adjacency list is sorted in increasing order and T is rooted in vertex $5.$Answer the following questions. and DRAW THE TREE FOR BOTH DFS AND BFS$.1.$ The depth of T$\_1$ is$?2.$ The number of leaves of T$\_1$ is $?3.$ The maximum number of children of a node of T$\_1$ is $?4.$ The depth of T$\_2$ is$?5.$ The number of leaves of T$\_2$ is$?6.$ The maximum number of children of a node of T$\_2$ is $?$