a. The data structure used to hold the Open and Closed lists can significantly affect the A* algorithm's runtime performance. True False b. The data structure operation with the largest impact on A* performance is: Add node record to list Remove node record from list Find smallest element in list Find specific entry in list c. Of the four data structures below, the one least suitable for A* node list implementation: Basic priority queue Priority heap Bucketed priority queue Quadtree d. Of the four data structures below, the one consisting of multiple unsorted lists, each holding nodes records in predetermined range of cost values: Basic priority queue Priority heap Bucketed priority queue Quadtree e. Node array A* differs from general A* in that these are created at start: Nodes Connections Node records Paths f. Node array A* is faster and requires less memory than general A*. True False