Consider the following pseudocode.

Algorithm multisearch$($ data, target $)$:

data: a 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$($ Idata.after$()$ and $!$ found$)\{$

$//$ 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$.$ Be sure to clearly identify the line that is the active operation. Show all your

work and express your final answer in Big$-$O notation $($because we are doing a worst$-$case analysis$).$