$21\mathrm{.}1.$ What is the asymptotic runtime for each of the following algorithms for computing kn$,$ where k is an integer and n $>=1$ is a power of $2?$