How many digits are there in 101, 102, and 103? It's fairly easy to answer 2, 3, and 4, respectively, and we can quickly convince ourselves that, in general, 10n is 1 followed by n zeros and, thus, 10" has n 1 digits. But what about 3100? How many digits are there in 3100?1 In this task, you'll write a program that will answer this question. Counting digits might seem pointless to you, but counting is frequently used in programs (e.g., for bioinformatics applications) Write a program that counts the number of digits in j* where j and k are integer values specified by the user. Your program should consist of at least two functions calculate (): Calculates the value of j* and the number of digits in j. main ): Prompts for the base j and exponent k and displays the results of the calculations Don't forget to include docstrings in each function and to end your program with a call to main (). Your output should be similar to the following 1 Enter the base j: 3 2 Enter the exponent k: 100 4 3 ** 100 515377520732011331036461129765621272702107522001 s This number has 48 digits 'Actually, there's a way to figure this out fairly easily: use int (klog1oU)) we don't know how to calculate logarithms yet. + 1, where J = 3 and k 100, but