Programming – Algorithm Analysis, need somebody to check if…

Q1 Algorithm Design7 PointsDungeonGator is a repository containing n*m books, each of which has a title length of at most tcharacters. All the books are stored in a 2-D container or collection, A[n][m] which has n rows and mcolumns. Each slot in the container contains a random book title. Thus the collection is not sorted and ispurely random. For example,A[n][m] 0 … m-10 pride and prejudice … don quixote. . . .. . . .n-1 the great gatsby … ulyssesWrite a function using pseudocode or C++ code that takes in as input this repository and returns a new1-D container with unique book titles. The returned repository must keep one copy of multiple repeatedbook titles.Note: You can assume that the input collection or container is a 2-D array. Other containers like vectorsor lists are fine as long as you state what you are using.