Can someone help me out calculate this?

RSA Algorithm Step 1: choose two prime numbers, says p = 23 and q = 23 Step 2: compute n Step 3: compute o (n) Step 4: select an integer e What are the requirements for e? e = ? Compute d = ? Consider a message M = 5, use the encryption key to encrypt the message E = Now decrypt E using decryption key