Let G be a digraph with V = {a, b, c, d, e}. For each of the following sets of edges, describe how connected the graph would be, and whether it contains a cycle. As always, explain your answers.
 E = {⟨a,b⟩,⟨c,a⟩,⟨c,b⟩,⟨d,b⟩,⟨b,e⟩,⟨e,c⟩,⟨e,d⟩}  E = {⟨a,c⟩,⟨b,c⟩,⟨b,d⟩,⟨c,d⟩,⟨d,a⟩,⟨d,e⟩}
 E = {⟨a,c⟩,⟨b,d⟩,⟨c,b⟩,⟨d,c⟩}
 E = {⟨a,c⟩,⟨b,d⟩,⟨c,b⟩,⟨e,c⟩}