Write a recursive function in pseudocode that computes the value of the following recurrence relation:

H$($n$)=$

$1$if n $=1$H$($n $1)+6$n $6$if n $>1.$

Give descriptive preconditions and postconditions. $($Hint: See Example $3\mathrm{.}10.)$

preconditionn $?=><$ postcondition $$

H$($n$)=$