Help Description: Program in c with arrays and math

The objective of this project is to develop a program in C that implements the banker$$s algorithm. The program simulates resource allocation and management in a multi$-$process environment where customers make requests and release resources from a central bank. The banker, acting as the resource manager, will grant requests only if they maintain system safety, ensuring deadlock avoidance.

The Banker:

The banker evaluates requests from n customers for m types of resources. To manage resources effectively, the banker maintains the following data structures:

#define NUMBER$\_$OF$\_$CUSTOMERS $5$

#define NUMBER$\_$OF$\_$RESOURCES $4$

$/*$ The available amount of each resource $*/$

int available$[$NUMBER$\_$OF$\_$RESOURCES$]$;

$/*$ The maximum demand of each customer $*/$

int maximum$[$NUMBER$\_$OF$\_$CUSTOMERS$][$NUMBER$\_$OF$\_$RESOURCES$]$;

$/*$ The amount currently allocated to each customer $*/$

int allocation$[$NUMBER$\_$OF$\_$CUSTOMERS$][$NUMBER$\_$OF$\_$RESOURCES$]$;

$/*$ The remaining need of each customer $*/$

int need$[$NUMBER$\_$OF$\_$CUSTOMERS$][$NUMBER$\_$OF$\_$RESOURCES$]$;

The banker grants a request if it adheres to the safety algorithm. Requests that jeopardize system safety are denied. Function prototypes for requesting and releasing resources are defined as follows:

int request$\_$resources$($int customer$\_$num, int request$[])$;

void release$\_$resources$($int customer$\_$num, int release$[])$;

The request$\_$resources$()$ function returns $0$ upon successful allocation and $-1$ upon failure.

Testing Your Implementation:

Design a program that enables user interaction for requesting and releasing resources, as well as displaying the current values of the different data structures $($available$,$ maximum, allocation, and need$)$ associated with the banker$$s algorithm.

Invoke your program by passing the number of resources of each type through the command line. For instance, if there are four resource types with ten instances of the first type, five of the second type, seven of the third type, and eight of the fourth type, execute your program as follows:

$./$a$.$out $10578$

The available array will be initialized with these values. Initially, the program reads a file containing the maximum number of requests for each customer. For example, if there are five customers and four resources, the input file format is as follows:

$6,4,7,3$

$4,2,3,2$

$2,5,3,3$

$6,3,3,2$

$5,6,7,5$

Each line in the input file represents the maximum request of each resource type for each customer. The program initializes the maximum array accordingly.

The user then enters commands to request resources, release resources, or display the current values of the data structures. Use $\text{'}$RQ$\text{'}$ for requesting resources, $\text{'}$RL$\text{'}$ for releasing resources, and $\text{'}*\text{'}$ to output the values of the different data structures. For instance, to request resources $(3,1,2,1)$ for customer $0,$ enter the following command:

RQ $03121$

The program outputs whether the request would be satisfied or denied based on the safety algorithm. Similarly, to release resources $(1,2,3,1)$ for customer $4,$ enter the command:

RL $41231$

Finally, entering the command $\text{'}*\text{'}$ outputs the values of the available, maximum, allocation, and need arrays.

Sample execution output $($THIS IS JUST AN EXAMPLE$)$:

Welcome to the Banker's Algorithm Simulation

Initializing system with resources:

Available: $[10,5,7,8]$

Reading maximum request file...

Maximum requests initialized:

Customer $0$: $[6,4,7,3]$

Customer $1$: $[4,2,3,2]$

Customer $2$: $[2,5,3,3]$

Customer $3$: $[6,3,3,2]$

Customer $4$: $[5,6,7,5]$

Please enter commands:

$-\text{'}$RQ customer$\_$num resource$\_1$ resource$\_2$ resource$\_3$ resource$\_4\text{'}$ to request resources

$-\text{'}$RL customer$\_$num resource$\_1$ resource$\_2$ resource$\_3$ resource$\_4\text{'}$ to release resources

$-\text{'}*\text{'}$ to display the current values of the data structures

$-$ 'exit' to quit

Command: RQ $03121$

Requesting resources for Customer $0...$

Request granted. System is in a safe state.

Command: RQ $12222$

Requesting resources for Customer $1...$

Request granted. System is in a safe state.

Command: RQ $21111$

Requesting resources for Customer $2...$

Request denied. System would be left in an unsafe state.

Command: RL $12222$

Releasing resources for Customer $1...$

Resources released successfully.

Command: $*$

Current system state:

Available: $[5,1,3,6]$

Maximum:

Customer $0$: $[6,4,7,3]$

Customer $1$: $[4,2,3,2]$

Customer $2$: $[2,5,3,3]$

Customer $3$: $[6,3,3,2]$

Customer $4$: $[5,6,7,5]$

Allocation:

Customer $0$: $[3,1,2,1]$

Customer $1$: $[0,0,0,0]$

Customer $2$: $[0,0,0,0]$

Customer $3$: $[0,0,0,0]$

Customer $4$: $[0,0,0,0]$

Need:

Customer $0$: $[3,3,5,2]$

Customer $1$: $[4,2,3,2]$

Customer $2$: $[2,5,3,3]$

Customer $3$: $[6,3,3,2]$

Customer $4$: $[5,6,7,5]$

Command: exit

Exiting program. Goodbye!