Can you help me solving this question?

roblern 4.4, t0 ponts. ASsume there exists a polynomal-time algorithl - that given an RSA public key (N, e) can invert 1% of all ciphertexts C E Z, That is, given (N, e) and C = Me mod N it can efficiently compute M if C happens to be in a "weak" 1% fraction of all ciphertexts. Show that then there exists an algorithm that given (N, e) inverts every ciphertext C E ZN with probability more than 1/2, and is usually efficient (runs in expected polynomial im Hint. Use the multiplicative property of RSA: for every public key (N, e) and