COMPLEJIDAD GETPOS

                                                                              //O(n)
    private Nodo<T> getPos(int i)throws ExceptionUFPS{            //T=6+c1+3+1+E(1+2+2)+1
        if(this.esVacia() || i>this.tamanio  || i<0){                           //6
            throw new ExceptionUFPS("El índice solicitado no existe en la Lista Simple");//T(Exception)
        }               
        Nodo<T> t=this.cabeza;                                                  //3
        while(i>0){                                                             //1+E(1)
            t=t.getSig();                                                       //2
            i--;                                                                //2
        }        
        return(t);                                                              //1
    }

T = 6+c1+3+1+1n+2n+2n+1 = 11+5n+c1 = n

O(n)