Consider the following binary search tree $B$ and the $2-3$ tree $T.$

Let $B_1$ be the result of applying an Insert operation with key $13$ on $B$ and let $B_2$ be the result of applying a Delete

operation with key $22$ on B$.$ Furthermore, let $T_1$ be the result of applying an Insert operation with key $7$ on $T.$

Answer the following $7$ questions. $1.?$ The

height of B$\_1$ is$?2.$ The height of B$\_2$ is$?3.$ The

height of T$\_1$ is$?4.$ The number of leaves in B$\_1$ is$?5.$ The

number of leaves in B$\_2$ is$?6.$ The number of nodes with $1$ keys in T$\_21$is$?7.$ The number of nodes with $2$ keys in T$\_1$ is$?$