What is the primary advantage of a hash table over a binary search tree?A$)$ Faster search timeB$)$ Ordered dataC$)$ Easier implementationD$)$ Less memory usage