1. import java.util.Scanner; 2. public class root 3. 4. public static void main(Stringi args) 5. { 6. Scanner input = new Scanner(System.in); 7 double number = input.nextDouble(); 8. double a = 2; 9. while (Math.abs(a-(number/a))>=0.25) { 10. a = (a+(number/a))/2; 11. } 12. a = Math.floor(a); 13. number = a; 14. a = 2; 15. while (Math.abs(a-(number/a))>=0.25) { 16. a = (a+(number/a))/2; 17. } 18. a = Math.floor(a); 19. System.out.println(int) a); 20. } 21. } In Big O notation, what is the run-time of this algorithm as a function of the input n? Select one: a. O(log n) Ob (1) O c. O(log n) + Odlog n) 0 d. On) O e. O(2 log n)