Which best describes this axiom: aList . getEntry ( i + 1 ) = ( aList . remove ( i ) ) . getEntry ( i ) When an item is removed from a list the items below are all moved toward the end of the list to fill the gap When an item is removed from a list the position is held open for the next item that gets inserted When an item is removed from a list the items below are all moved toward the beginning of the list to fill the gap None of these

C++

What is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elements

Recursive Multiplication Given an JavaScript object list of books that each have a pages attribute to define the number of pages in the book, find the product of all the pages in the object list of books using recursion (you must use recursion to solve this problem). Keep in mind: The input list object may be completely empty (ex. {}) The next attribute may not be defined function getPageCount(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":1,"next":{"book":"B","pages":2,"next":{"book":"C","pages":3,"next": null}}}Output: 6Reasoning: 1 * 2 * 3 pages