Consider the following graph $G.$

Compute the DFS tree $T_1$ and the BFS tree $T_2$ when starting in vertex $0.$ Assume that

the adjacency lists are sorted in increasing order. Consider the following graph

$$

$.$

Compute the DFS tree $1$ and the BFS tree $2$

$$when starting in vertex $0.$Assume that the adjacency lists are sorted in increasing order. Answer the following questions.

$1.$How many leaves are there in T$1?$

$2.$ What is the depth of T$1?$

$3.$What is the maximum number of children of a node in T$1?$

$4.$How many leaves are there in T$2?$

$5.$What is the depth of T$2?$

$6.$What is the maximum number of children of a node in T$2?$