Write down the running time equation, T(n), of the program prob3 below. Find an upper bound of T(n), using the Big-O notation to describe the upper bound. Find a lower bound of T(n), using the Omega notation to describe the upper bound. # # Input: a list L that has n numbers. def prob3 L : s=0 for x in L: for i in range(len (L)): s=xL[i] for x in L : s+=x return s