1. (20 pts.) For each code fragment below, give the complexity of the algorithm. Give the tightest possible upper bound. The input size variable is n. a) for (int i=0;i0) x=x1 1 2 e) int x=1; while (x<><>