A monkey is banging repeatedly on the keys of a typewriter. Each time, the monkey is equally likely to hit any of the 26 lowercase letters of the English alphabet, 26 uppercase letters of the English alphabet, and any number between 0-9 (inclusive), regardless of what it has hit before. There are no other keys on the keyboard. Suppose the monkey hits the keyboard 5 times. Compute the chance that the monkey types the sequence Data8. (Call this data_chance.) Use algebra and type in an arithmetic equation that Python can evaluate. Write a function called simulate_key_strike. It should take no arguments, and it should return a random one-character string that is equally likely to be any of the 26 lowercase English letters, 26 uppercase English letters, or any number between 0-9 (inclusive). Write a function called simulate_several_key_strikes. It should take one argument: an integer specifying the number of key strikes to simulate. It should return a string containing that many characters, each one obtained from simulating a key strike by the monkey. Hint: If you make a list or array of the simulated key strikes called key_strikes_array, you can convert that to a string by calling "".join(key_strikes_array). This question is inspired by a mathematical theorem called the Infinite monkey theorem (https://en.wikipedia.org/wiki/Infinite_monkey_theorem), which postulates that if you put a monkey in the situation described above for an infinite time, they will eventually type out all of Shakespeare's works.