1. Show that O(loga n) = O(logb n) for a, b > 1. Hint: loga n = logb n / logb a.

2. Consider problems in the photo below

Problem-4: Using Big Oh notation, indicate the time requirement of each of the following tasks in the worst case. a. Display all the integers in an array of integers. b. Display all the integers in a chain of linked nodes. c. Display the nth integer in an array of integers. d. Compute the sum of the first n even integers in an array of integers. Problem-5: Show that 32+2" is 0(2") What values of c and N did you use? Problem-6: show that 4n2 +50n - 10 is O(n2)