is below. Write a recursion formula for the running time T(n) of the function whose code function (int n) { if(n = 1) return; for(int i = 1; i < n; i++) printf(" + "); function (0.8n); }