Consider the following linked list and pointer called temp:

We then perform the following operations:

Create a variable called $x,$ and assign it the value obtained from dereferencing temp

Update temp to point at next node

Multiply $x$ by $4$

What is the final value of $x?$Why might an array be preferred to the linked list data structure?

It is easier to add and remove data

Pointers are not stored in the data elements

It is easier to implement extensible abstract data structures

References to elements can be known without inspecting the elements