Correct Answer (Detailed Explanation is Below)
A.
Searching
Detailed Explanation
Searching is the operation used to locate a particular element or determine whether it exists.
Linear Search checks elements sequentially and has O(n) worst-case complexity.
Binary Search can achieve O(log n) time when the data is sorted and the structure supports appropriate access. Hash tables can provide average-case O(1) lookup under suitable conditions. Therefore, searching is one of the fundamental operations associated with many data structures.