(c) Let Go = (V, M) be a graph with V = {a, b, c, d, e, f} and M is the set of edges represented by the following adjacenty matrix: a C d e 0 M = 0 0 0 0 0 0 0 0 i) What type of Graph is Gc? A. unidirected B. directed C. Acylic D. Cyclic E. There is not enough information to state whether Gc is undirected. F. There is not enough information to state whether Gc is ayclic. ii) Which of the following statements are true about the unidirected version of graph Gc? That is, where all directed edges are replaced with their corresponding unidirected versions. A. Gc is 1-vertex connected. B. Gc is 2-vertex connected. C. Gc is 3-vertex connected. D. Gc is 4-vertex connected E. Gc is 1-edge connected F. Gc is 2-edge connected G. Gc is 3-edge connected H. Gc is 4-edge connected 1. None of the above