3. (30 points) At a given starting time (say t = 0), the sales (S) of an enterprise are estimated to be x, i.e., S(0,x)=x. In an optimistic model for the enterprise, the sales at a given subsequent time (t 1, 2, ...) are predicted to be the average of sales for all previous times multiplied by a constant factor C> 1 (e.g. C = 1.2). Such model can be expressed as: = S(t, x)=C x for t= -Σ S(i,x) for t>0 i=0 Implement a recursive brute force algorithm to compute S(t,x) at a given time (t). • • Find the number of double arithmetic operations T(t) for that algorithm.