$($d$)$ Write a recurrence relation $T(n)$ that describes the number of basic operations done by the function bar that takes in an array of size $n.$ Make sure you also include any base cases for your recurrence.