A linked list avoids the shifting problem. Start Insert B A C W B linked list: array: A C B W 0 1 2 3 Insert B Captions Inserting an item at a specific location in an array requires making room for the item by shifting higher-indexed items. Once the higher index items have been shifted, the new item can be inserted at the desired index. To insert new item in a linked list, a list node for the new item is first created. Item B's next pointer is assigned to point to item C. Item A's next pointer is updated to point to item B. No shifting of other items was required. Feedback? PARTICIPATION ACTIVITY 1.1.3: Basic data structures. 1) Inserting an item at the end of a 999-item array requires how many items to be shifted? Check Show answer 2) Inserting an item at the end of a 999-item linked list requires how many items to be shifted? Check Show answer 3) Inserting an item at the beginning of a 999-item array requires how many items to be shifted? Check Show answer 4) Inserting an item at the beginning of a 999-item linked list requires how many items