Consider the following algorithm for the problem to find missing numbers in an integer array with duplicates.

Array may contain more than one duplicate value.

Require: Missing numbers from the Array

Ensure: Integer Array having duplicate values

Set counter = len(Ensure)

int i Ensure

set counter = 1 for all given numbers in Array

while i < len(counter) do

if counter[i] == 0 then

missing-number = counter[i]

end if

end while

(a) (1 mark) Show the time complexity of this algorithm.

(b) (3 marks) Dry run the algorithm for the values from 1 to 10 (with some duplicates) and shows that the algorithm will produce the correct answer