An algorithm to determine the greatest common divisor between two integers M and N is as follows: 1. Get input from user for the first integer M 2. Get input from user for the second integer N 3. While M not equal to N repeat: if M > N: Replace value of M by M - N else N > M: Replace value of N by N - M 4. Display M 5. Stop Describe the algorithm above in a flowchart. [3 Marks]