Given an RSA public key and assuming we have an algorithm A that always correctly computes lsb(x) [ Least Significant bit] given [x mod N]. Write the pseudocode for an algorithm A' that computes x from [xmod N], also consider that you know the factorization of N. Note: (Please use the variables/ notations used in class for writing the pseudocode and keep the pseudocode simple with assignments, if conditions for loops, you don't need to write actual code). Given an RSA public key and assuming we have an algorithm A that always correctly computes lsb(x) [ Least Significant bit] given [x mod N]. Write the pseudocode for an algorithm A' that computes x from [xmod N], also consider that you know the factorization of N. Note: (Please use the variables/ notations used in class for writing the pseudocode and keep the pseudocode simple with assignments, if conditions for loops, you don't need to write actual code)<><>