please explain clearly in steps and answer these questions. thanks.

a) Given a hash table with a fixed size of 10 using quadratic probing and a hash function h(x) = x. If we start from an empty hash table and perform only insertions. Given the final status of the table shown below: null 0: null 1 null 2 3: null 4: 15 5: 55 6: 76 7: null 8: null 9: 25 Which of the following can NOT be true in terms of insertion order? Select all that apply. 15 was inserted before 25 25 was inserted before 15 25 was inserted before 76 76 was inserted before 25 55 was inserted before 76 76 was inserted before 55 b) Given the input (4371, 1323, 6173, 4199, 4344, 9679, 1989), a fixed table size of 10 with linear probing, and a hash function h(x) = x. Which option(s) below are NOT true of the table after we add the inputs in order (no deletion). Assume that we start with an empty hash table (t) which stores Integers (not ints). Select all that apply: t[0] == 9679 t[4] == 4344 Ot[6] == null t[9] -- 1989