What is the time complexity of this method with the following signature :b$)$ public E remove $($int index$)$

public E remove$($int index$)\{$

if $($index $<mtext></mtext><mn>0</mn><mtext></mtext><mi>|</mi><mi>|</mi>$ index $>$ size$)\{$

System.out.println$("$out of

bound"$)$;

return null;

$\}$

E element;

if $($index $==0)\{//$ remove from

front

element $=$ head.getElement$()$;

head $=$ head.getNext$()$;

if $($head $==$ null$)\{//$ special

case, if the only element is removed

tail $=$ null;

$\}$

$\}$ else $\{$

curr $=$ head;

for $($int i $=0$; i $$ index $-1$;

i$++)\{$

curr $=$ curr.getNext$()$;

$\}$

element $=$

curr.getNext$().$getElement$()$;

if $($tail $==$ curr.getNext$())\{$

tail $=$ curr;

$\}$

curr.setNext$($curr$.$getNext$().$getNext$())$;

$\}$

size$--$;

return element;

$\}$