I need a detailed solution to the following question, based on 'math for information security'

Use any open source package, like Openssl, to apply RSA considering the following scenario: Alice decides to use RSA with the public key N = P.Q. She designs the system by selecting two prime numbers generated considering a length of 500 bits. She selected an exponent e and calculated its secret inverse called d. Bob needs to encrypt a shared key consisting of 20 digits called K. Then, Alice would decrypt the encrypted key and use it to encrypt a file using any symmetric algorithm like AES. Show the implemented scenario and print all the outcomes for both Alice and Bob.