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 41 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 .

Bol is a has table with separate c aining and a linked ist Has unctio is given as nx x % 10 hat is the num er o comparisons needed o search fora e function is one operation. You can ignore all operations that are not a comparison or call to a hash function 4 in each data structure on a compar son s e o ration an one to a asn 91 234 94-74 - 73-| 41 53 -61 12 91 41 61 12 23 73 53 94 74 1. Number of operations required to search for element 41 in the linked list? 2. Number of operations required to search for element 41 in the hash table? Check