Write Find(x) and Decrease-Key(x) helper functions to support complementary data structures of a hash table and minimum priority queue. A unique string is used as the hash table key, as well as identifying elements with identical priority. Find(key) returns a pointer to the priority queue and should run in O(1). Decrease-Priority(key,value) modifies both the hash table and priority queue after setting element with "key" to the priority "value". It should run in O(lgn).