A repository containing n books each of which has a title length of at most t characters. Each book has at most p pages. Some of these books have more than one copy and they are identified by the same title. All the books are stored in a container or collection, A[2][n] which has two rows and n columns. Each column represents one book and the row 0 represents book title and row 1 represents the number of pages of the corresponding book.

A [ ] [ ]

Title_1	Title_2	Title_3	...	Title n
Pages_1	Pages_2	Pages_3		Pages_n

This collection is not sorted and is purely random. Write a function using pseudocode that takes in as input this repository and returns a new repository removing all duplicate book titles.

Comment on the worst, average, and best case complexity in Big O notation.