9 (+) 2.25/3 points ! Previous Answers HunterDM2 51 022 Write a recursive function in pseudocode that computes the value of the following recurrence relation: ifn=1 H(n 1) 6n - 6 if n > 1 H(n) = function H(2n = ? 1.2.3.? ?) if ??n=1 then return 1 else return 6?? (n1)?+H(n??1) Score: 0.75 out of 0.75 Comment: Give descriptive preconditions and postconditions. (Hint: See Example 3.10.) precondition n12 postcondition h(n)= 1 eBook