4. List the sequence of permutations of the items 4, 7, 0, 9 generated by the incremental algorithm. 5. Given the graph in this page, perform DFS and BFS. For each traversal, aside from the output, show also the content of the stack (DFS) and queue (BFS). Starting vertex is 1. 3 5 1 8 4 6. Given the same graph you use in the previous item, consider each vertex as a task that must be done considering the dependencies with other tasks. Find a linear ordering of how each task in the graph could be performed that preserves the precedence rule. For each vertex, compute also the finishing time. Starting vertex is 1. 2

4. List the sequence of permutations of the items 4, 7, 0, 9 generated by the incremental algorithm. 5. Given the graph in this page, perform DFS and BFS. For each traversal, aside from the output, show also the content of the stack (DFS) and queue (BFS). Starting vertex is 1. 3 5 1 8 4 6. Given the same graph you use in the previous item, consider each vertex as a task that must be done considering the dependencies with other tasks. Find a linear ordering of how each task in the graph could be performed that preserves the precedence rule. For each vertex, compute also the finishing time. Starting vertex is 1. 2