figure comparing (nwith common big- functions for in range( ) the number of assignment operations is the sum of four terms the first term is the constant representing the three assignment statements at the start of the fragment the second term is since there are three statements that are performed times due to the nested iteration the third term is ntwo statements iterated times finallythe fourth term is the constant representing the final assignment statement this gives us ( by looking at the exponentswe can easily see that the term will be dominant and therefore this fragment of code is ( note that all of the other terms as well as the coefficient on the dominant term can be ignored as grows larger figure shows few of the common big- functions as they compare with the (nfunction discussed above note that (nis initially larger than the cubic function howeveras growsthe cubic function quickly overtakes (nit is easy to see that (nthen follows the quadratic function as continues to grow self check write two python functions to find the minimum number in list the first function should compare each number to every other number on the list ( the second function should be linear ( what is algorithm analysis