(a) Write a computer program (or develop an algorithm) to locate the first occurrence of the maximum value in an array a1, a2, a3, ... , an of integers. (Here n ∈ Z+ and the entries in the array need not be distinct.)
b) Determine the worst-case complexity function for the implementation developed in part (a).