Bob just discovered an efficient algorithm to factor large numbers, i$.$e$.,$ for any given

number n$,$ Bob can factor the number in O$($log$($n$))$ time. Please describe the impact of

this discovery on the RSA algorithm.