Consider the \"typical-case\" performace for the searchalgorithsms. In orther words the average number of comparisonsneeded over all possible positions where the elements can befound.
a) used to locate and element in a list of n terms with linearsearch
b) used to locate an element in a list of n= n^k terms usingbinary search.
