Graphs: A complete graph has every vertex connected directly to every other vertex. Draw an example with 4 vertices as an undirected and as a directed graph. a undirected graph (2pts) b. directed graph (2pts) A connected graph has to have a path between every pair of vertices. Draw a smallest (least possible number of edges) connected graph with 4 vertices as an undirected and a s a directed graph a undirected graph (2pts) b. directed graph (2pts) How many edges does a tree of N nodes have (regardless of tree type)? Why? (2pts)