1)EVEN THOUGH LINKED LIST IS IMPLEMENTED USING ARRAY,TO DELETE A ELEMENT FROM LIST IT TAKES WPRST CASE OF O(N).
because elements are not stored in either incresing order and decresing order,we are not guarantee deleted element occupies which position.so to search entitre list then only know which place it occupies.
2) To reverse the list with the help of last pointer go last node in unit of time and make it as head node.
it is implemented using cirular array ,so no need of change any pointers only first and last pointer .it is done in o(1) time