Write a function generateRSAKeys(p, q)that returns the public key (n, e) and the private key d, given parameters for the two prime factors pand q. Your function can assume that the arguments will be primes. The function can find a value for eby starting at 3 and incrementing it by 2 until it finds a value where eis relatively prime to hat is, gcd(e) = 1. (Why does it make sense that even values for eneed not bechecked?)

Any multiple choices

All links together are together

Choice 2.the algorithm constantly checks to see if the value in the position before is greater than the value in the current position. if there is even one instance, it will return false and stop looping.using an if-statement without } and { means that the if-statement true condition only applies for the next lineconsider  . the condition  checks if previous position is greater than or equal to current position. if it is, it will make method return false. for that example, it won't.consider  , it would return falseconsider  . it would return false