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 character Input: n: length of data Output: array containing every element of data, with duplicates removed 1 Algorithm: Unique 2 dict= Dictionary(data) a prev - dict.Min() 4 next-prev .Successor(prev 5 unq= {prev 6 While next * NIL do 7 | If next prev then 8 9end 10 | prev= next 11 | next-dict.Successoripreu) 12 end 13 return unq Add nert to 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 2. What is the worst-case time complexity for Unique when implementing dict as a sorted array? Show your work 3. Compare and contrast these two implementations, and indicate which you wouldd recommend