Explain with details if you can please.

10) Algorithms of Different Orders Homework. Unanswered Name at least one algorithm which is of each of the following complexity orders. (Try to name an algorithm which has not already been referred to on the test -- at least not in Big-O terms.) i) O(n) ii) O(log2 n) iii) on iv) 0(1) 11) Memoization Homework. Unanswered Briefly explain the concept of memoization as it applies to recursive functions. (What's the basic approach? What is it trying to accomplish? When is it applicable? Etc.)