Add provided HW01.hs file
Fill in name/collaborators in HW01.hs header
Add Exercise 1 solution for lastDigit
Add Exercise 1 solution for dropLastDigit
Add Exercise 2 solution for toDigits
Add Exercise 3 solution for doubleEveryOther
Add Exercise 4 solution for sumDigits
Add Exercise 5 solution for validate
Add Exercise 6 solution for hanoi
Add provided HW02.hs, Words.hs files
Add Exercise 1 solution for formableBy

This is a naive solution using pattern matching and recursion.
Add wrong solution to Exercise 3 wordFitsTemplate

It occurred to me that if I pulled the letters out of the template and
added them to the hand, I could just use formableBy with that expanded
hand to see if the given string was possible. I failed to notice that
this doesn't account for matches which are too short to complete the
pattern, as in the third test case, which I'm glad was included, or I
would have believed my incorrect solution for longer than I did.
Fail to correct wordFitsTemplate with length

I had things wrong in my head (typical), and thought my earlier, wrong
solution was wrong simply because the pattern and string could have
lengths that didn't match, so I assert that they do here. However, the
overall assumption that adding the hand and template's chars together
would create a pool to draw from makes no sense - there aren't any
letters in the template; those are just placement stand-ins.
Correct solution for Exercise 3 wordFitsTemplate

This is a lot more exhaustive than my previous 2 attempts, and I think
correct. An empty template with an empty string is a match. If each has
at least one character, then either they match, and we recurse on the
tails of each, or the template's head is a '?' and the string's head is
a character in our hand, in which case we remove it from the hand and
recurse with tails of the template and string. If we run out of both the
template and string simultaneously, the first pattern matches, yielding
True, and failing all of the above, we get a False.
Add solution for Exercise 4, wordsFittingTemplate

Similar in form to wordsFrom, as the homework notes suggested.
Add solution for Exercise 5, scrabbleValueWord
Add solution for Exercise 6, bestWords

This is not very optimal. I'm walking the list several times.
Add wordFight helper function

wordFight will pare down a list of words using a current best value and
an accumulator list. This should help with bestWords optimization.
Simplify bestWords using wordFight

bestWords is now more in the shape of a fold.
Add solution for Exercise 7, scrabbleValueTemplate

This uses a helper function, scrabbleValueTemplate', which seems like
the opposite of a wholemeal solution. It's way too involved.