State two advantages that the bisection method has over Newton's method. Problem 5 Given a numerical algorithm A with time complexity O(logn) and another algorithm B that has time complexity O(n), please answer the following: Of the two algorithms A and B, which is considered to be less complex (or more efficient) based purely on the time complexities given for each algorithm? HINT: simply plot real values against increasing values of n; compare the two equations, that is, notice we have two functions, log(n) and n, and we may determine which function is increasing more rapidly than other; afterwards, you may visually determine of the two which is considered to be more efficient as the number of iterations (or as the value of n ) increases