2. Quadratic probing uses the following indices to define a probe sequence (k + A modulo n for /20 where k is the hash index and n is the size of the hash table a. If the hash table contains 17 locations and the hash index is 3, what are the first six indices of the array loca- tions in the probe sequence that quadratic probing defines? b. You can compute the indices for the probe sequence more efficiently by using the recurrence relation +1=(ki + 2i + 1) modulo n for 1 > 0 and ko-k Derive this recurrence relation. traction c. Demonstrate that you can replace the modulo operation in Part & with one comparison and an occasional sub