(b) Analyze the running time of the following procedure which calculates the largest one day drop or increase in the price of a certain commodity/stock, given by a list of numbers. /* a[1] is the price on first day, a[2] is the price on day 2, ... return the largest increase/drop (from one day to the next) in the data LargestOneDayDifference (a[1...n]) largest Change = 0 //initialzation for i=1 to n-1 if (abs (a[i+1]-a[i])) > lagestChange largestChange = abs (a[i+1]-a [i]) return largest Change