Solve anagram problem using TDD & RSpec.
Given a list of strings, return a list of list of strings of anagrams, i.e. each element of the returned list is a list of words that are anagrams among them.
For example,
input: [stars, mary, rats, tars, army, banana]
output: [ [rats, tars], [army, mary], [stars], [banana] ].