Lastly, provide the worst-case big-theta runtimes for inserting n items into a hash table given each collision resolution strategy. Give your answer as a function of s (the size of the table) and n (the number of elements being inserted into the table). Briefly explain your answer.

7. [6 points] Lastly, provide the worst-case big-theta runtimes for inserting n items into a hash table given each collision resolution strategy. Give your answer as a function of s (the size of the table) and n (the number of elements being inserted into the table). Briefly explain your answer Strategy Linear Probing Separate Chaining Double Hashing 7. [6 points] Lastly, provide the worst-case big-theta runtimes for inserting n items into a hash table given each collision resolution strategy. Give your answer as a function of s (the size of the table) and n (the number of elements being inserted into the table). Briefly explain your answer Strategy Linear Probing Separate Chaining Double Hashing