Visually design the above algorithmic process in any of the Java, C, C++, C# or Python programming languages.

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.

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