C++ problem please add explain thanks

Consider the following structure struct Node Node "prev int key; Node next; hi 10 12 Consider a pointer 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 node with the value 10 and an extra node named newnode with a value of 15 ter executing the tollowing tenp-onext newnade nennode-next tenp-next; nemnode->prew-tenp; tenpnextprev- newnade what will be the output if we print the linked list from tail to head? Select one. Segmentaton fa O b. 37 15 10 5 12 O c none of these d 37 10 15 5 12 O O e. Infinite loop 12 5 15 10 73 Check