This is a discrete mathematics question and needs to be answered as such.

5 (20 points) a. Give a big-Oh estimate for the number of times count is incremented in the following pseudocode. count: 0 for i-1 to n for j := i + 1 to n for k:- 1 to n countcount1 b. Let M be a list of m integers in non-decreasing order and let N be a list of n integers in non-decreasing order. (1) Describe an algorithm that will take M and N and produce a new list containing all the elements from M and N in non-decreasing order. (2) Analyze the runtime and space requirements for your algorithm using big-Oh notation. Be sure to explain your analysis Example: M= [1, 3, 5, 6, 7 N=[3, 5, 5, 6, 8, 9, 111 Output: [1,3, 3,5,5, 5,6, 6,7,8,9,11