In Figure 1, (a) Determine if the graph is simple. (b) Determine if there is a cycle in this graph. (c) Determine if the graph is strongly connected. (d) Determine if the vertices 2 and 11 are connected. If these vertices are connected, find a path from vertex 2 to vertex 11. (e) Find a path, if any, from vertex 1 to vertex 3 that has 4 edges. Activate Win Go to Settings to 5 8 6 1 7 (10) 2 Figure 1 Graphs for Question 1. (11)