Select the best generalized algorithm for adding to a list using a linked chain implementation:

Create a new node, populate the data and next fields of the new node, update the linked chain to include the new node
  • Update the firstNode reference, create a new node, populate the data and next fields of the new node
  • Prepare the linked chain for the new node, create a new node, populate the data and next fields of the new node
  • Create a new node, populate the data and next fields of the new node, update the firstNode reference

There are no hints for this question