Given the following Node: struct Node { int data; Node next; Node* prev; Node(int data) { this->data = data; next = nullptr; prev }; }; nullptr; and code snippet: Node n1 = new Node(1); Node n2 = new Node(2); n3- new Node(3); Node n1->next = n2; n1->prev = n3; n2->next n3; n2->prev n1; n3->next n1; n3->prev = n2; Node current = n1; for(int i=0; i < 5; i++) { cout < < current->data; current = current->next; } for(int i = 0; i < 5; i++) { cout < < current->data; } current current->prev; What would be the output?