1. Let G be a graph such that V (G) = {v1, v2, v3, v4} and E(G) = {e1, e2, e3}. If e1 is incident on v1 and v4, e2 connects v3 and v4, and v2 is the only endpoint of e3, answer the following question: (a) (5 points) Draw the graphical representation of graph G. (b) (9 points) Find three different walks from v1 to v3 and specify whether each one of them is a path/trail from v1 to v3. (c) (10 points) Construct the adjacency matrix of G. (d) (9 points) Draw three different subgraphs of G. (e) (6 points) Find all of the connected components of G. Is G connected?