Consider the following ways of handling deadlock: (1) banker’s algorithm, (2) detect deadlock and kill thread, releasing all resources, (3) reserve all resources in advance,
(4) restart thread and release all resources if thread needs to wait, (5) resource ordering, and (6) detect deadlock and roll back thread’s actions.
a. One criterion to use in evaluating different approaches to deadlock is which
approach permits the greatest concurrency. In other words, which approach allows
the most threads to make progress without waiting when there is no deadlock?
Give a rank order from 1 to 6 for each of the ways of handling deadlock just listed,
where 1 allows the greatest degree of concurrency. Comment on your ordering.
b. Another criterion is efficiency; in other words, which requires the least processor
overhead. Rank order the approaches from 1 to 6, with 1 being the most efficient,
assuming that deadlock is a very rare event. Comment on your ordering. Does
your ordering change if deadlocks occur frequently?

who can answer part B for me?