Problems:
1. Write a single program. Each of the problems (2-4) should be written within a procedure. Your “main” procedure should call each procedure. Before calling each procedure, your main method should clear the screen, and prompt the user to press “Enter” to see the results of the next problem. Be sure to account for additional inputs as each problem requires.
2. Write a procedure that displays a single character at 100 random screen locations. Use a randomized delay between characters (between 10 and 300 milliseconds).
3. Implement Euclid’s algorithm for finding the greatest common divisor of two positive. Your program should take two positive integer inputs and output the greatest common divisor. The pseudocode for Euclid’s Algorithm is:
GET X and Y
WHILE Y != 0
X = X mod Y
INTERCHANGE X,Y
END WHILE
DISPLAY X
4. Implement a procedure that multiplies any two unsigned 16-bit integers using only shifting and addition. Your program should take in two inputs (16-bit) and display the output result.