using c++ data structures please list steps and explain.

Select the answer that best applies. 8 The following recursive function inserts a value as the last item in a linked implementation of a list. Read the following code and determine what goes in blank void Insert/Node Type*& listNode. Value Type value) 1/ Pre: listNode is defined // listNode is a pointer to a list. 1/ Post value is inserted in a node, which is placed at the end of the list { if (listNode - // 1 ( Node Type 112 = value listNode = 1/3 = NULL; else Insert value) 1/5 } listNode->next listNode-> Info O value OO