(3 pts) A(n) is a formally specified set of values and associated operations, independent from any particular implementation. (3 pts) Function is used to allocate dynamic memory in C. (3 pts) A(n) is a specialized version of a linked list in which nodes can be inserted only at the end of the list and deleted only from the end of the list. (3 pts) (circle one) If you wanted to build an application that stores words in dictionary ordering, which data structure is most appropriate? a. Linked list b. Object c. Stack d. Struct (3 pts) (circle one) If you wanted to build an application that performs "backtracking" in a maze so that the beginning of a path can be recovered if the wrong path is taken, which data structure is most appropriate? a. General linked list b. Struct c. Stack d. Heap