graph, an edge from node labeled A to a 7. 12 points] in aln) node labeled B is the same as having an edge from bt b) directed d) tree-like e) none of the above 8. t2 points] in a(n)- graph, every two pairs of vertices are connected two pairs o a complete b. simple c directed d. pair e. parallel Fill in the blank (Q9& 10) 9. [2 points] Two edges are said to be( ) if they are connected to the same vertex. 10. [2 points] The ( ) of a vertex is the number of edges incident to it. 11.[ 2 points] A breadth-first traversal of a graph uses which of the following data structures? a) binary search tree b) queue c) stack d) array e) none of the above 12. [2 points] If most of operations on a list involve retrieving an element at a given index, should you use Arraylist or LinkedList? Your