low in Java Generator ANSI/AIM Code 39 in Java low lowEncoding Code-39 In JavaUsing Barcode creation for Java Control to generate, create Code 39 Extended image in Java applications.918 Continuing from Exercise 917, after part (a), a perform a test so that the smaller subarray is processed by the first recursive call and the larger subarray is processed by the second recursive call b remove the tail recursion by writing a while loop and altering low or high,as necessary c prove that the number of recursive calls is logarithmic in the worst-case 919 Suppose that the recursive quicksort receives an int parameter, depth,from the driver that is initially approximately 2 log N a Modify the recursive quicksort to call mergesort on its current subarray if the level of recursion has reached depth(Hint: decrement depth as you make recursive calls; when it is 0, switch to mergesortPaint Bar Code In JavaUsing Barcode encoder for Java Control to generate, create barcode image in Java applications.b Prove that the worst-case running time of this algorithm is O(N log N) c Conduct experiments to determine how often mergesort gets called d Implement this technique in conjunction with tail recursion removal in Exercise 917 e Explain why the technique in Exercise 918 would no longer be neededBarcode Decoder In JavaUsing Barcode reader for Java Control to read, scan read, scan image in Java applications.920 An array contains N numbers, and you want to determine whether two of the numbers sum to a given number K For instance, if the input is 8 , 4 , 1 , 6 and K is 10, the answer is yes (4 and 6) A number may be used twice Do the following a Give an O(N2) algorithm to solve this problem b Give an O(N log N ) algorithm to solve this problem (Hint: Sort the items first After doing so, you can solve the problem in linear time) c Code both solutions and compare the running times of your algorithms 921 Repeat Exercise 920 for four numbers Try to design an O(N210g N) algorithm (Hint: Compute all possible sums of two elements, sort these possible sums, and then proceed as in Exercise 920) 922 Repeat Exercise 920 for three numbers Try to design an O(N2) algorjthm 923 In Exercise 628 you were asked to find the single integral solution ~oA%B~+C~+D~+E~=F~W~~~O