design a banker's algorithm using 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.