What will be the output of Pseudocode?Integer n, rev, rem, origSet n = 61206, rev = 0Set orig = nWhile n NOT EQUALS 0            rem = n MOD 10            rev = rev * 10 + rem            n = n / 10End whileIf (orig IS EQUAL TO rev)           Print revElse            Print (orig – rev) / 6End If

The pseudocode provided is a program to reverse a number and then check if the original number is equal to the reversed number. If they are equal, it prints the reversed number. If they are not equal, it subtracts the reversed number from the original number, divides the result by 6, and prints the result.

Let's go through the pseudocode step by step:

1. Initialize n to 61206, rev to 0, and orig to n (61206).
2. Enter a while loop that continues as long as n is not equal to 0.
3. Inside the loop, rem is set to the remainder of n divided by 10. This effectively gets the last digit of n.
4. rev is then updated to be rev times 10 plus rem. This effectively adds the last digit of n to rev, shifting any existing digits in rev one place to the left.
5. n is then divided by 10, effectively removing the last digit.
6. Repeat steps 3-5 until n is 0.
7. After the loop, check if orig is equal to rev. If they are equal, print rev.
8. If orig is not equal to rev, subtract rev from orig, divide the result by 6, and print the result.

Now, let's run the pseudocode with the given value of n (61206):

1. n is 61206, rev is 0, and orig is 61206.
2. Enter the while loop.
3. rem is 6, rev is 6, and n is 6120.
4. rem is 0, rev is 60, and n is 612.
5. rem is 2, rev is 602, and n is 61.
6. rem is 1, rev is 6021, and n is 6.
7. rem is 6, rev is 60216, and n is 0.
8. Exit the while loop because n is 0.
9. orig (61206) is not equal to rev (60216), so subtract rev from orig (990), divide by 6 (165), and print the result.

So, the output of the pseudocode will be 165.