Analyze the worst-case run-time complexities of the member functions reverse() and remove_if(). Give the complexities in the form of Big-O.

template  void List::reverse() { if(!empty()) { auto current_ptr=head; while(current_ptr != nullptr) { std::swap(current_ptr->next, current_ptr->prev); current_ptr=current_ptr->prev; } } std::swap(head, tail); } 

****************************************************************

template  template  void List::remove_if(PREDICATE pred) { for(auto i = begin();i != end();) { if(pred(*i) == true) { i = erase(i); } else{ ++i; } } }

8.5.7