algorithm - repeat exercise - for figures and illustrating dijkstra' algorithm - repeat exercise - for figures and illustrating kruskal' algorithm - repeat exercise - for figures and illustrating the primjarnik algorithm - how many edges are in the transitive closure of graph that consists of simple directed path of verticesr- given complete binary tree with nodesconsider directed graph having the nodes of as its vertices for each parent-child pair in tcreate directed edge in of from the parent to the child show that the transitive closure has ( log nedges - simple undirected graph is complete if it contains an edge between every pair of distinct vertices what does depth-first search tree of complete graph look liker- recalling the definition of complete graph from exercise - what does breadth-first search tree of complete graph look liker- say that maze is constructed correctly if there is one path from the start to the finishthe entire maze is reachable from the startand there are no loops around any portions of the maze given maze drawn in an gridhow can we