Directed Graphs Let G = (V, E) be a directed graph where E = {(a, b), (a, e), (b, a), (b, c), (b, d), (c, a) (d, c), (e, a)} a. Given that all nodes v elementof V has at least one edge where (u, v) elementof E or (v, u) elementof E what is V? b. Show that sigma_v elementof v deg^+ (v) + Sigma_v elementof v deg^-(v) =2 |E| c. What is the size of the graph