Visually design the above algorithmic process in C++

user define at least 3 resources (can be optional),

- let him enter the total number of resources,

- Number of assigned resources can be entered manually or you can randomly throw,

- Enter maximum request matrix manually

- After entering the maximum request matrix, let the demand matrix determine itself.

It turns out already.

Then;

- User can manually set a task arrival sequence such as ; Is this a safe situation?

You can also think of a different solution for the last item. Another example; It can set random task sequences one after the other and stop when a safe situation is found.

Assigned first Available 3 3 2 MAX A B C 7 53 B C A B C Need A A BC 7 0 2 6 7 4 3 1 Po o to P12 3 2 2 P213 0 2 g 02 P3 2 1 1 2 2 2 0 0 2 4 33 8 To Instantly Need MAX - Assigned 1) To + 1 = TP1, P3, P4, P2, Po> when run in sequence Is it safe? Is it unsafe? Availables px [(4,2.0) ] -Px [(A,B.c)] Available Need (first) Available first > Need - Sure Situation 2) To +2 3) To +2 4) Tot3