suppose that your program stores a list of strings. the user is permitted to access the string at a given position (index) in the list, and can make as many accesses as they wish. n is the number of strings in the list. which data structure would provide the best performance for the user accesses and why? select one:
