Improve your implementation for 1 by using your Text Converter, so it can handle a string from a user and output a string.

Hint: you can execute the RSA function once for each letter, i.e., the plaintext “hello” needs five executions. For example, the input “hello” will be encrypted as follows:

“hello” is converted to a list of characters: [‘h’,’e’,’l’,’l’,’o’]
the list of characters is converted to a list of decimals as per ASCII code: [104, 101, 108, 108, 111]
each decimal in the list is encrypted by the “RSA” function implemented for 2.
make some text codes of “Encryption” and “Digital Signature” to demonstrate the validity of the implementation (10 points)
Do some experiments to answer the question “How big primes can your computer handle?”, and “How fast does the computation overhead increase as the primes are getting bigger?”