uld you create an algorithm using psuedocode for this problem:   Consider a problem in which you have a set of n keys and n locks. Every key corresponds to exactly one lock, and every lock corresponds to exactly one key (this correspondence means that all items are unique, no duplicate keys or locks are present). Create an algorithm that efficiently (less than O(n2) time) pairs up every lock with its corresponding key. By fitting a lock and key together, you can see if fit is correct (the single match), if the lock is too small for the key, or if the lock is too large for the key. As part of this algorithm, you cannot compare lock A to lock B, nor key A to key B (no direct comparison between members of the

Write a program that, given an array a[] of Ndouble values, finds a closest pair : two values whose difference is no greater than thethe difference of any other pair (in absolute value). The running time of your programshould be linearithmic in the worst case

Create an efficient java code to solve the problem by using Greedy algorithm only.

Given a sequence of integers, e.g., \[ 9,-1,45,6,8,21,34,5,55,65,543,18,90,122,132,0,66,100,-12,17 \] design an algorithm/method to re-arrange the order of the data items (i.e., form a new sequence of the integers) so that when the data items are inserted sequentially into an initially empty BST, the newly created BST will be a balanced BST. a) Design the algorithm (in pseudo code) and analyse your algorithm. b) Write a Python function/method to implement your algorithm. c) Write a program that calls the above function, thereby demonstrating your algorithm by (i). Print the re-arranged data items (i.e., a new sequence) generated by the algorithm, and (ii). Build a BST using the newly generated data sequence as input (that is, insert the data items, oneby-one, into an initially empty BST). Print the tree shape of the BST. (Note: The program should use at least two datasets to demonstrate the algorithm, one of which is the dataset given above).