For each of the next questions, consider the following tables as the initial system state as seen by the Banker's algorithm approach to deadlock avoidance. Consider each question independently, starting each time from this initial state. allocated R1 R2 R3 remaining need R1 R2 R3 available R1 R2 R3 -- - 12 2 2 A B 1 1 2 2 3 3 1 2 3 1 2 3 2 1 0 3 2 1 13. T/F A request by A for 1 unit of R1 can be safely granted. 14. T/F A request by B for 1 unit of R1 can be safely granted. 15. T/F A request by C for 1 unit of R1 can be safely granted. 16. T/F A request by A for 1 unit of R2 can be safely granted