Question No. 3 [10 Marks) We wish to build a Hash Table, which is able to deal with collision by using linear and quadratic probing. Please write a public class HashimQuad as follows public class HashlinQuad private int[] table://hash table private int size://current number of elements private int capacity //capacity of the hash table private HashlinQuad (int size} | table = new int[size] ) public int addin (int obj) { ... //add obj into table using linear probing 1 public int addQuad (Int op) ... //add obj into table using quadratic probing ) ) 1. Implement the two methods addin and addQuad that apply linear and quadratic probing respectively. 2. Test your implemented methods additin and addQuad. To this end, create the following two objects in class HashLinQuad linlashlable = new HashLinQuad(1249). HashLinQuad quad HashTable = new HashLinQuad(1249): 3. Please insert the same 1000 random integer values in the same order) into: a the object WinHashTable' by using the method addin' and count the number of collisions. b. the object quadHashTable by using the method addQuad' and count the number of collisions. 4. According to the results, compare and discuss both collision resolution strategies as a comment in your implementation (eg, directly below the lines above)