Consider the Unique algorithm below, which takes an input array data of length n and returns all of the elements that appear in data, with duplicates removed Input: data: array of characters Input: n: length of data Output: array containing every element of data, with duplicates removed 1 Algorithm: Unique 2 dict = Dictionary(data) 3 prev=dict,Min() 4 next = prevSuccessor(prev) 6 while next NIL do if next prev then Add next to unq 8 9end 10 prev next 11 | next=dictSuccessor(prev 12 end 13 return unq Answer the following questions about Unique: 1. What is the worst-case time complexity for Unique when implementing dict as a balanced BST? Show your work What is the worst-case con dict as a sorted array? Show your work. time complexity for Unique when implementin 3. Compare and contrast these two implementations, and indicate which you would recommend