this question is already posted , but one damm /idiot man can't solve this,.

https://www.chegg.com/homework-help/questions-and-answers/1-2-u-explain-using-example-b7-mod-11-b-b3-mod-7-q31128177

NOTE- IF YOU CAN'T SOLVE WITH EXAMPLE THEN NEVER TRY TO SOLVE

Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute b mod m,0 b, n m ? A. O(log n) B. Own log n D. O(n) 2. can u explain using the example (a) b7 mod 11 (b) b3 mod 7