Look at the graphs below and select all of the graphs that are NOT strongly connected. Fig A rigC Fig D A written description of the figure now follows. Text description of figure: edge (A,C) between vertex A and vertex C. C and vertex D. There is an edge (D,C) between vertex D and vertex C. (B,B) is a self-loop. There is an edge (C,D) between vertex C and vertex D