Which of the following perfect Hash table operations cost a constant time in its worst case? Select one: O a. Insert only O b. Search only O c.Delete only d. All the above A hash table (Separate Chaining) has an array size of 256. The maximum number of entries that can be placed in the table is Select one: O a 256 b. There is no maximum c. 256 2 O d. 255 For a binary tree the first node visited in inorder and postorder traversal is same. Select one: O a. True O b. False Which of the following perfect Hash table operations cost a constant time in its worst case? Select one: O a. Insert only O b. Search only O c.Delete only d. All the above