Below is a hash table with separate chaining, and a linked list. Hash function is given as f(x) = x % 10. What is the number of comparisons needed to search for a key of 63 in each data structure? One comparison is one operation and one call to a hash function is one operation.You can ignore all operations that are not a comparison or call to a hash function .

Number of operations required to search for element 63 in linked list?

Answer 1 Number of operations required to search for element 63 in hash table?

EDIT:: Here is the question again