An H tree of order n is a recursive design based on the letter H. The following are H trees of orders 0, 1, and 2: Each H is centered at a given point and consists of three line segments of equal...

An H tree of order n is a recursive design based on the letter H. The following are H trees of orders 0, 1, and 2:

Each H is centered at a given point and consists of three line segments of equal length. Each H has a half-sized H centered on each of its four tips. Write a program to draw an H tree of order n using recursion.