Which of these implementation strategies attempts to approximate random access into an array?

Question $4$Answer

a$.$

doubly linked nodes

b$.$

sorting

c$.$

hashing

d$.$

singly linked nodes

e$.$

recursion