Part1: Deadlock Avoidance: Banker Algorithm: Write a program in any language that implements the Bankers algorithm to avoid deadlocks, which might happen when using multiple instance resources. The application should have a user interface to enter: Number of processes, resources and instances, current allocation, maximum and available resources. Based on the above value entry, your application should tell if the system is in a safe or an unsafe state. If there is a safe sequence, display it. If there is a deadlock, display deadlocked processes. Part2: Scheduling Algorithms: Round Robin (RR) Write a program in any language to implement the Round Robin scheduling algorithm. The user should enter a number of processes, their arrival times and their burst times. Data entry can be through console or graphical interfaces or embedded in the program. Your program should find, select and display the order in which the processes are executed (it will be nice if you can draw the Gantt chart) and the start and end of each execution cycle (you can add the length of the execution cycle). At the end, calculate the average waiting time of all the processes and display it