1. For each of the graphs below, answer the following questions: B to no F D A E HY Graph #1 G m A A E B oneosib as svi riqsig orl to noite!! Ben Graph #2 qang Graph #3 a. Is it directed or undirected? b. What are the vertices and what are the edges? What are the self-loops, if any? c. What are the degrees, in-degrees, and out-degrees of vertices A, B, C, and D? d. What is the degree of the undirected graphs? e. Are vertices A and B adjacent? Are C and D adjacent? f. Is D reachable from C? If so, give a simple path from C to D. g. Are there cycles? Identify one, if any. h. Are the undirected graphs connected? i. Are the directed graphs strongly connected? j. Give a subgraph of Graph #1 that is isomorphic to Graph #2. S