Can this be solved? The other part is split into another question.

Now let's compute

Now let's compute 2k) using an iterative method. (d) Use the result in (a) to prove that for N 2 3, S(2N) 2 = 2 (e) We can quickly verify that S(3) by simple geometry. Use this as the initial data and compute S(3072) and S(24576). Here, 3072 3 210 3 213. (Hint: Don't use manpower. and 24576 - Design an algorithm and use your preferred programming language.) (f) Briefly explain why ancient people didn't directly compute sin(f) for large N, but preferred the iterative way. There're in fact multiple reasons, aud you just need to come up with one reason.