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

c++, need explain thanks

3181 236472-439 5394H4 31811 72 23 43 53 64 494 Number of operations required to search for element 94 in linked list? Number of operations required to search for element 94 in hash table