A2 Graded. HOORAY? BOO?

Actually, it's a "Hooray" for my partner and I. We were both really worried about the first problem involving ternary trees. Instead of finding a formula, we developed a recursive method in python to count the number of configurations of ternary trees. Then we developed a pre-condition and post-condition for our method and proved its correctness in regard to our conditions. We got a pretty good mark for that question, so I'm happy. Hmm... we should probably show our proof to Danny. I'm sure he's interested to see how we proved our algorithm considering it took us forever and a day to come up with it in the first place.