b) 1) If each bucket in an array is attached to linked list this is called a) linear probing quadratic probing c) separate chaining d) skip list 2) A method that relies on the values being sorted in order is a) separate chaining b) binary search c) linear probing d) quadratic probing 3) The compression function in which, if bucket Ali] is filled, we try bucket A [li+1) mod N] is called a) linear probing b) quadratic probing c) cyclic shift d) separate chaining acte lao b) From the character leaf to the root c) neither 5) The method that uses the fewest bits to represent the most frequent characters is a) spate chaining b) linear probing c) quadratic probing d) Huffman coding 6) In an array named arr of size 5, if we cout