What is the worst-case running time for inserting n items into an initially empty hash table,

(a) Where collisions are resolved by chaining?

(b) Where collisions are resolved by chaining, and each list is stored in sorted order? Note that this is still a linked list, not a skip list.

(c) Where collisions are resolved by linear probing?

For each part, justify your answer briefly. If you need to make a reasonable assumption about the problem statement in order to do so, state that assumption explicitly in your answer.