Write a recursive function laugh that takes a positive integer $n$ and returns a string consisting of "ha" repeated $n$ times. For example, laugh 3 should return "hahaha".