C++assume alist is a list of the integers {50, 15, 20, 45, 35, 10, 5}. for parts (a) and (b), display the order of elements in alist after calling f(); template void f(list & alist, t item) { queue q; list: : iterator iter = alist. begin(); while (iter ! = alist. if (*iter > item) { q. push(*iter); alist. erase(iter++); } else iter++; while (! q. { alist. push_back(q.; q. pop(); } }(a) list after calling f(alist, 30). ) list after calling f(alist, 12).