Time Complexity and BigOH

SHOW WORK

Question 7 (6 points): Consider the following pseudocode Algorithm multisearch( data, target): data an list of arrays of integers; in each array the integers are sorted in ascending order; the list data has a cursor. target: an integer // Iterate over the arrays in the list 'data' using // its cursor data.goFirst) found false while( !data.after) and !found ) 1 // search for integer 'target' in A found -binarySearch (data.currentItem ), target) data.goForth () Using the active operation approach to timing analysis determine the time complexity of this pseu docode in the worst case. Assume that the list of arrays contains n arrays and that each array has exactly m items in it. Show all your work and express your final answer in Big-O notation