Question

Discussion Assignment #2
Complete the following exercises and post your answers to the discussion forum. In each assignment the questions and answers are provided so that you can self-check your work. What is important is your ability to show your work or line of reasoning.   After submitting your assignment you should engage with your peers to both validate your own techniques and perhaps critique the work of others. The objective of this assignment is for all of the members of the class to work collaboratively to develop a solid understanding of the Asymptotic assessment of an algorithm and the ability to solve recurrence relations

Exercise 1
f( n ) = n⁶ + 3ⁿ
f( n ) = 2ⁿ + 12
f( n ) = 3ⁿ + 2ⁿ
f( n ) = nⁿ + n

Answer 1