To support efficient before(p) and addBefore(p, e) operations, the Positional List ADT is efficiently implementing using which data structure? Select one: O a. A singly linked list that uses a head pointer and a tail pointer O b. A singly linked list that uses a head pointer and no tail pointer O c. A circularly linked list that uses tail pointer (no head pointer) O d. An array-based list that doubles in capacity on each resize O e. a doubly linked list that uses a head pointer and a tail pointer