Remarks: In a algorithm, always prove why they work. ALWAYS, analyze the com plexity of your algorithms. In all algorithms, always try to get the fastest possible. A correct algorithm with slow running time may not get ful credit. In al data structures, try to minimize as much as possible the running time of any operation. . Question 2: A directed bipartite graph G(U, W, E), has no edges inside U, no edges inside W, and
OR
OR