Recently, researchers have successfully decrypted the RSA ciphertext using one of the RSA cryptanalysis techniques, called prime factorization, without knowing the private key. Say, Trudy is an intelligent hacker who knows RSA encryption algorithm and prime factorization very well. Hence, she has been hired by someone who wants to know the secret message between Alice and Bob. Trudy uses her understanding on the prime factorization-based RSA cryptanalysis techniques for retrieving Alice and Bob's secret message. As you know from Lecture-3 and Tutorial-3, the public-key component (n) of the RSA cryptosystems is an integer that has two prime numbers. Assume that Bob's RSA public-key is published as: n = 4599788129 and e = 3919. Trudy wants to find the private-key (d) for the above RSA public-key. You need to perform the followings: a) Show step by-step process how Trudy can find the private-key (i.e., RSA key breaking) using prime factorization. b) Show how the secret message (M) can be computed from the captured ciphertext C = 700100670. c) How could Trudy take advantage of multiple computers to perform the integer factorization tasks mentioned above for breaking RSA faster? Explain with detailed steps