Given an n-node complete binary tree T,rooted at a given position, consider a directed graph _G having the nodes of T as its vertices. For each parent-child pair in T,  create a directed edge in _G from the parent to the  child. Show that the transitive closure of _G has O(nlogn) edges Compute a topological ordering for the directed graph drawn with solid edges in