figure is for question 7

7) Based on Figure 6-5, @), on page 445 of the textbook, which of the following statement is NOT true? A. Process G is holding resource V and asking for resource U B. Resource T has been allocated to process E C. Resource R has been allocated to process A D. Process D is holding resources U and T and asking for resource S 8) To require all processes to request all their resources before starting execution is to attack A. the mutual-exclusion condition B. the hold-and-wait condition C. the no-preemption condition D. the circular waiting condition dead end. Remove it and go back to the previous node, that is, the DEADLOCK DETECTION AND RECOVERY . ks 445 S U v U w G 6. If this node is the initial node, the graph does not contain any cycles (a) Figure 6-5. (a) A resource graph. (b) A cycle extracted from (a). dynamic data structure, L. a list of nodes, as well as a list of ares. During he algorithm, to prevent repeated inspections, arcs will be marked to indicate that they have already been inspected, The algorithm operates by carrying out the following steps as specified: 1. For each node, N, in the graph, perform the following five steps with Nas the starting node. 2. Initialize L to the empty list, and designate all the arcs as unmarked. 3. Add the current node to the end of L and check to see if the node now appears in L two times. If it does, the graph contains a cycle (listed in L) and the algorithm terminates. 4. From the given node, see if there are any unmarked outgoing ares. If so, go to step 5; if not, go to step 6. 5. Pick an unmarked outgoing arc at random and mark it. Then follow it to the new current node and go to step 3. uses one One that hefore this one, make that one the current