3. Algorithmic Analysis Consider the following function to compute @b sup d@ where both @b@ and @d@ are integers greater than or equal to 0 de f powerl (b, d) resul t 1 while d 0 result = result * b d=d-1 return(reslt) Using order-of notation (i.e., O(...)), what is the expected runtime of this algorithm in terms of @b@ and/or @d@? Explain. Consider the following alternative function, also to compute @b sup d@ def power2(b. d) result = 1 while d 0: if d%2-0 resulresult c else: d=d//2 return (result) What is the expected runtime of this algorithm in terms of @b and/or @d@? Explain