10 What is the function below doing to the Sequence in the input? Is this function treating the Sequence more like a vector (ArrayList) or list (NodeList). What is the time complexity (in Big O notation) of the algorithm? void functionl (Sequence &S) { int n = S.size(); for (int i = 0; i < n; i++) { for (int j=1; j *successor) { int tmp predecessor; *predecessor = *successor; *successor = tmp;