The tollowing Python program generates Motzkin trees. They are made ot leaves, unary noces (noces with one branct) and binary nodes (nodes with two brances) t Motzkin tree of 3ize n dei mot (n) : if r--0: yiold 'loaf else for m in not (n-l): yield 'unary',m) for k in range(,n1): for 1 in mot. (k): or r in mot (n-2-k) : yield ('binary',1,r) def test (m) or n in range (m): ist (mapiprint, list. (mot. (n)))) write a Python program that generates the game output without using the "yield" atatement. The program may use Python arrays, tuples, dictionarie but no cla53ea To tacilitate grading, the program should provide a tunction similar to "test (m)", that given an natural number m, prints out all trees of size less than , one per line, in the aame format