An Interesting Numerical Algorithm Write a program that asks the user to enter a three-digit number in which the digits are in decreasing order. (Two examples are 973 and 742.) Display the result of the following calculations: (a) Reverse the digits of the number, then subtract the reversed number from the original entered number. Call the difference n. (b) Add the number n to the number obtained by reversing the digits of n See Fig. 5.48. (Note: The result will always be 1089.) Use a Boolean-valued Function procedure to verify that a valid number is entered, and use a Function procedure that reverses the digits of a three-digit number. Figure 5.48 Output of Programming Project 8. Algorithm Ente a 3-digit number with 353 Perfom Algorithm Result: 1089 FIGURE 5.48 Output of Programming Project 8 863 strictly decreasing digits