(e) (8 marks)

What is the worst case for your implementation?

What is the worst-case complexity of your implementation? Explain your reasoning.

Give your answer in Big-Theta notation, e.g. (1), (n), or in words, e.g. the worst-case complexity is constant or linear in n.

You may take the input size n to be the total number of items in the three lists. For example, [ ['soup','onion','potato','leek','celery'], ['pizza','bread','tomato','cheese'], ['banana'] ] has size 10.

Insert your explanation here