Trace the steps for the Interpolation search to find the key = 198 in the following data set:

100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 192, 198, 230, 235, 237, 250 [Points: 6] Which search algorithm will you select for the following data set (data will grow in the same order) and why? Also what will be the time complexity for that algorithm? [Points: 1 + 2 + 2 = 5]

100, 110, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 220, 230, 240, 250

What is the optimal block size to be skipped in jump search for the data set mentioned in Q4.c? Also, what is the time complexity? [Points: 2+2=4]