Based on the following four graphs, answer the questions

$6.$ Which of the graphs is represented by the following adjacency matrix?

$\backslash$table$[[,1,2,3],[,0,1,1],[2,0,0,0],[3,1,1,0]]$

A$)$ G$1$

C$)$ G$2$

B$)$ G$3$

D$)$ G$4$

$7.$ How many of the graphs have a cycle?

A$)1$

C$)2$

B$)3$

D$)4$

$8.$ The type of the following tree is

A$)$ Balanced binary tree

C$)$ Min heap

B$)$ Perfect binary tree

D$)$ All of them

$9.$ What is the Maximum height of the tree that could be built by $6$ nodes?

A$)2$

C$)4$

B$)3$

D$)5$

$10.$ If the characters $\text{'}\text{'}$ are pushed in a stack $($in that order$),$ and then removed one at a time, in what order will they be removed?

A$)$ WXYZ

C$)$ WYZX

B$)ZYxW$

D$)$ ZYWX

$11.$ The method "delLast$()"$ in a circular singly linked list needs a shorter time than in a noncircular singly linked list.

A$)$ True

B$)$ False