Which of the following scenarios leads to expected linear running time for a random search hit in a linear-probing hash table? a. All keys hash to the same index. b. All keys hash to different indices. c. All keys hash to an even-numbered index. d. All keys hash to different even-numbered indices.