5. (16 points) For each C++ function below, give the tightest asymptotic upper bound that you can determine for the function's runtime, in terms of the input parameter. Where prompted, also compute the return value of the function. Express both runtime and return value in simplest terms. For all function calls, assume that the input parameter n > 1. (a) int regiftedsocks(int n) { int k = n; int x = 1; for (int w = 1; w<>