$\begin{align*} &\text{A(n) is a recursive function having the following recurrence call structure }\\ \\ &\text{x} \leftarrow \text{x} + 8.{\bf\color{red}{\text{A}(n/2)} }+n^3 \\ \\ &\text{Corresponding recurrence relation for time complexity would be} \\ \\ &T(n) = {\bf \large \color{blue}{1}}.{\bf \color{red}{\text{T(n/2)} }}+ O(1) \\ &\Rightarrow O(\log n) \end{align*}$