chap listsstacksand queues /*list adt *public interface list /*remove all contents from the listso it is once again empty client is responsible for reclaiming storage used by the list elements *public void clear()/*insert an element at the current location the client must ensure that the list' capacity is not exceeded @param item the element to be inserted *public void insert( item)/*append an element at the end of the list the client must ensure that the list' capacity is not exceeded @param item the element to be appended *public void append( item)/*remove and return the current element @return the element that was removed *public remove()/*set the current position to the start of the list *public void movetostart()/*set the current position to the end of the list *public void movetoend()/*move the current position one step left no change if already at beginning *public void prev()/*move the current position one step right no change if already at end *public void next()/*@return the number of elements in the list *public int length()/*@return the position of the current element *public int currpos()/*set current position @param pos the position to make current *public void movetopos(int pos)/*@return the current element *public getvalue()figure the adt for list