In this problem, you will design an algorithm to compute ${2024}^n$ given ninN as input. In cach case, prowe

the correctness of your algorithm, and an upper bound on the number of multiplications used.

Using $n-1$ many multiplications.

Solution: INSERT YOUR SOLUTION HERE

Using $O(lo{g}_{2}n)$ many multiplications, assuming $n$ is a power of $2,$ i$.$c$.,n=2^k.$

Solution: INSERT YOUR SOLUTION HERE

Using $O(lo{g}_{2}n)$ many multiplications for any $n($not necessarily a power of $2).$