Please answer these multiple choice questions.

52. Answer the following questions given a hash table of size 5 that uses linear probe open addressing. Insert the following elements into the table: 3,28,2,27. 44. Where does element 3 end up? (a) entry 0 (c) entry 2 (e) entry 4 (b) entry 1 (d) entry 3 45. Where does element 28 end up? (a) entry 0 (c) entry 2 (e) entry 4 (b) entry 1 (d) entry 3 46. Where does element 2 end up? (a) entry 0 (c) entry 2 (e) entry 4 (b) entry 1 (d) entry 3 47. Where does element \&\& end up? (a) entry 0 (c) entry 2 (e) entry 4 (b) entry 1 (d) entry 3 48. On average, how many operations does it take to insert each element? (a) 1 (c) 2 (b) 1.2 (d) 2.25 49. What is the table load factor? (a) 4 (c) 1 (b) 2 (d) 0.8 50. If the table uses chaining instead of open addressing, on average, how many operations does it take to insert each element? (a) 1 (c) 1.5 (b) 1.2 (d) 2 51. How long does it take to insert something into a hash map? (a) O(logn) (c) O(1) (e) O(n) (b) O(n2) (d) O(nlogn) 52. How long does it take to find something in a hash map? (a) O(logn) (c) O(1) (e) O(n) (b) O(n2) (d) O(nlogn)