Problem on Primitive Operation to find asymptotic complexity – This is a single problem, single algorithm, however with different primitive operations. Please do observe how choosing different primitive operations affects time complexity. Suppose you are given a list of natural numbers. You should find maximum value in this list. Let N be the length of list, and assume that every n in the list satisfies n < K.Compute asymptotic complexity of algorithm in terms of N, K with time complexity of comparison for following three formulations.1. In this case, we assume the ideal natural number whose comparison takes constant time.2. In this case, we assume that natural number is given as binary-representation.3. In this case, we assume that natural number is given as unary-representation, meaning that as given below, where S is successor operator CalculusMathDifferential EquationsCOMPSCI 170
