Hello all. I am not in a programming class per say. It is actually a modern operating systems class and our teacher asked us to work out this little lab. It is not for any points but just to help us understand the concept of when deadlocks occur and such. Here is the lab:

Code the Bankers' algorithm for deadlock avoidance. Apply this algorithm against the following data displaying the Work, Need and Allocation matrices for each pass of the algorithm provided a safe state exists.
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6 Against request of (1,0,0,0) for P2.

Do the same for the following data:
Process Allocation Max Available
A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3 Against requests of (1, 2, 1) and (3, 3, 0). For P0.

And since i am not a programming major, I have no idea where to start. LOL!! Hopefully someone can help?