Consider the definition

h(n) = { 1 if n=1, h(n-1) +h([n/2]) + 1 if n > 1

An obvious algorithm to compute h is a recursive one, directly based on the above definition . Is that algorithm efficient ? Why or why not , if not how can the algorithm be improved ? justify your answer