Remarks: In all 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 full credit. In all data structures, try to minimize as much as possible the running time of any operation Question 3: Let G be a directed graph. A vertex decomposition of a graphs is a collection U1 UU2 of sets,
OR
OR