Part 1: Write Algorithm Create an algorithm using pseudocode that someone else can follow. Choose one of the following options: How to make a grilled cheese sandwich How to do a load of laundry How to tie a shoe

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.