Description: Tristan and Joey want to have fun and decided to play a new game using a calculator. They realized that a calculator has 10 digits (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) and with those digits different numbers can be formed. The name of the game is Unique Digits and the main rule is that a number cannot contain the same digit, for example 343 or 1522 are not valid numbers. The game consists of, given an interval of two numbers A, B (1<=A<=B<=5000), creating as many "valid numbers" as possible between the interval (that is, following the rule of NOT repeating a digit in a number). Tristan and Joey ask your help to code a C program that, given A and B, prints the valid numbers in the interval and displays the total valid numbers. Assume that the inputs of A, B are integers. The program must validate that the input restrictions are met. In case the input does not meet the requirements, an error message is displayed and the user prompted to re-enter both A and B again. Here are the restrictions: A and B range in [1 5000] A must be less equal than B (A<=B) Input: The program gets as input two integer values A, B (1<= A<=B<=5000), which represents the interval. Output: The program prints all valid numbers in ascending (each in a new line), and the total of them. Sample Run: Example 1 Enter the lower bound A [1-5000]: 2 Enter the upper bound B [1-5000]: 1 Error! Make sure A<=B Enter the lower bound A [1-5000]: 22 Enter the upper bound B [1-5000]: 25 23 24 25 3 Example 2 Enter the lower bound A [1-5000]: 1231 Enter the upper bound B [1-5000]: 1237 1234 1235 1236 1237 4