Consider auctions done using textbook RSA Encryption. Alice is selling a Phone and has public key PK. Bob would like to Bid 100 dollars. He encrypts his bid under public key PK and sends it to Alice. Trudy is watching over the channel and sees the ciphertext. He doesn't know Bob's bid. But he would like to bid exactly double of Bob and win the auction in style. Show that this is possible in RSA encryption.

Note: textbook RSA means without using hash