C++ programming, add explain, please.

Consider the following structure struct Node Node prev; int keyi Node next 10 12 Consider a pcinter named head that points to the first node in the linked list, a pointer named tail that points to the last node, a pointer named temp that points to the ncde with value 10 and a new node named newnode with value 15 Atter executing tollowing code newnode->prev- temp temp->next->prev newnode: temp-next- newnode: newnode snext temp--next what will be the output it we print the inked list from head to tall? Select one a. 12 5 10 73 O c. Infinite loop O d none of these O e. 12 5 15 1073 O 37 10 15 5 12 Check