Question & Answer: QUESTION 17 3 points Save Ans The correct implementation for a post-decrement operator for a doubly linked list iterator is (done as an inline fun…..

QUESTION 17 3 points Save Ans The correct implementation for a post-decrement operator for a doubly linked list iterator is (done as an inline function) node_iterator operator –int) current current>previous0: return “this node iterator operator-(int) node iterator original(‘this); current current->previous; return original; node iterator operator-intH node-iterator original = current; current = current->next: return original; node_iterator operator – node iterator origina(“this); current current->previous return original;