Implement Insersion Sort, Merge Sort, Quick Sort and Heap Sort. Given a graph G= (V, E) which may containcycles, we want to remove some edges to make the graph acyclic with minimum total cost. Can be ...