search occurs when rn/ thusthe running time is still (noperations add( ,eand remove(ialso must perform link hopping to locate the node storing the element with index iand then insert or delete node the running times of these implementations of add( ,eand remove(iare likewise (min( - + ))which is (none advantage of this approach is thatif or as is the case in the adaptation of the array list adt to the deque adt given in section then add and remove run in ( time butin generalusing array-list methods with java util linkedlist object is inefficient sequences sequence is an adt that supports all of the methods of the deque adt (section )the array list adt (section )and the node list adt (section that isit provides explicit access to the elements in the list either by their indices or by their positions moreoversince it provides this dual access capabilitywe also includein the sequence adtthe following two "bridgingmethods that provide connections between indices and positionsatindex( )return the position of the element with index ian error condition occurs if size( indexof( )return the index of the element at position multiple inheritance in the sequence adt the definition of the sequence adt as including all the methods from three different adts is an example of multiple inheritance (section that isthe sequence adt inherits methods from three "superabstract data types in other wordsits methods include the union of the methods of these super adts see code fragment for java specification of the sequence adt as java interface code fragment the sequence interface defined via multiple inheritance it includes all the methods of the dequeindexlistand