Question 1 (1 point) When repesenting a graph as an adjacency list, space is saved compared to representation as an adjacency matrix. 1) True 2) False Save Question 2 (1 point) The following are the degrees of each vertex in a simple graph in decreasing order There are no loops). Is this graph possible (True Yes, False-No)? 6, 6, 6, 6, 3, 3, 2,2 1) True 2) False Save Question 3 (1 point) A random undirected graph has 9 vertices. An unordered cycle is a connection within the graph that connects a number of vertices. For example an unordered cycle of 3 would be a triangle within the graph of 3 connected vertices. To find the total number of possible unordered cycles of 3 vertices from the total you can use the Combination Formula C(n,r) n!/r(n-r)! which is total number of possible combinations of r objects from a set of n objects. If the probability of an edge between any two vertices is 100% (all vetices connected)-what is the expected number of unordered cycles of length 3? 4 2) 10 3) 20 4) 35 5) 56