Access time of the symbol table will be logarithmic if it is implemented by

The correct implementation for logarithmic access time in a symbol table is a balanced search tree, such as an AVL or Red-Black tree. These structures maintain height balance, ensuring that search operations take O(log n) time. In contrast, linear lists typically require O(n) time for search, and hash tables provide O(1) average access time rather than logarithmic.