Give a summation that represents the number of times the statement x++ is executed in the following function. Then derive the summation's closed form (i.e., solve it). int foo (int n). { int i, j, x = 0; for (i= 1; i < n; i++) for (j = 0; j