In C++ write a method:

voidswapFourthAndFifthElement(). This method rearranges the 4th and 5th nodes. It cannot swap the data in the nodes, it instead must rearrange pointers.

Where:

Node * prev = new Node(); defines new pointer nad node

There are 3 data memembers count, front, back that can be accessed using this->