1. Develop and write pseudo code for an algorithm to do following steps:

1. Find the maximum number from an array of size n.
2. Find the minimum number from the same array of size n.
3. Find the difference between the largest and the smallest elements of the array.
4. Count that how many elements of the array are bigger than the difference computed in the previous step and output that number.

1. Analyze your algorithm and find its complexity class.