3. (1015 x 2-40 points) (1) Show the adjacency list of the following directed graph (Fig. 2), (2) then based on your adjacency list, show the induced spanning tree (or forest) by BFS and DFS. 4. (10 points) Use the same graph Fig. 2. Suppose each vertex represents a task, and each directed edge indicates a prerequisite. For example, the edge U3 ta indicates that we can start task ta only when v3 has been finished. Please use topological sort to schedule these 6 tasks (also show your idea in detail that how do you schedule them). U1 03 t2 Figure 2