Write a C++ program that implements the Banker's Algorithm in which the banker will grant a request if it satisfies the safety algorithm outlined in Section 8.6.3.1. If a request does not leave the system in a safe state, the banker will deny it. The request function should return 0 if successful and -1 if unsuccessful. Demonstrate an order in which the threads may complete for successful request. Continue the program by interactively enter a request by answer the following question: If a request from Thread 1 arrives for (1, 0, 2), can the request be granted successfully? //sample input 1102 //sample output 0 Thread 1, Thread 3, Thread 4, Thread 0, Thread 2