Consider this doubly linked list:Write a linear-running time method public void reverse() that would be invoked on a list object (e.g., lst.reverse()) and would reverse the list using only constant space (note that this precludes using recursion since as we discussed in class this would use a non-constant space in the call stack memory).

null Ist Ist head Ist tail nul