1. For the graph to the below find the following: D 213 a. The vertex set 9 b. The order of the graph c. The edge set d. The size of the graph e. A path from A to L, give the length. f. A cycle (circuit) of length 4 g. A cycle of length 2 h. List all the bridges. i. What is the sum of all the degrees of all the vertices? Is this graph connected or disconnected? Why? k. In this case, is the vertex set redundant? Why?