Answer Happy

[25 marks] [8 marks] 2 (a) (a) Complete the following implementation of recursive quicksort in Java, including the partitioning algorithm. What is the complexity of quicksort? public void recQuickSort (int left, int right) { long pivot = array[right]; } (b) Alice's EIGamal public key (p, g, gʻmodp) is (23, 11, 2). Obtain [8 marks] her private key by brute force. (c) [9 marks] Write a Java method which takes in an array of numbers and inserts them into a hash table so that their presence in the table can be queried in O(1) time. Assume that there is a class variable called int[] hashtable of size 9991 which represents the hash table. Select a collision resolution strategy of your choice and explain how it works.