1. Let R be a relation on set (1,2,3,4,5) with R (1,3),(2,4),(2,5),(3,1),(2,1), a. (5 pt.) Represent R as a directed graph G. b. (1 pt.) Find a walk of length 4 in G from vertex 2 to vertex 4 c. (1 pt.) Find a path of length 2 in G from vertex 5 to vertex 2. UIC d. (1 pt.) Find a circuit of length 4 in G starting at vertex 1 e. (1 pt.) Find a cycle of length 4 in G starting at vertex 5 f. (1 pt.) Is there an edge in G2 from vertex 4 to vertex 5? g. (5 pt.) Find the transitive closure of R