For the code given below, when m=387 and n=33, show the steps of the Euclidean algorithm. I have provided the pseudocode and shown the first 5 steps below.

count = 0

while ((r = m mod n) != 0)

m = n

n = r

count = count + 1

Output count, n and STOP.

1. count = 0

2. r = 387 mod 33 = 24 (which is not zero so continue with the statements in the loop).

3. m = 33

4. n = 24

5. count = 1

6. Etc.