Six words have had their trees removed. The trees have been placed into Group A. The remaining letters of each word have been placed into Group B. Your task is to reconstitute the words by merging each tree with the proper set of letters. Other than merging the two groups together, there is no rearranging of the letters. Example: sand + pne = spanned (SpANneD).
Group A: cedar, elm, maple, pine, spruce, willow Group B: bda, dfer, inniy, iplab, mionon, sltr
__________________
May your troubles be less,may your blessings be more,and may nothing but happiness come through your door
An anagram is a word or phrase formed by rearranging the letters of another word or phrase. For example, rearrange "none" to get "neon".
It is not considered an anagram if you exchange a letter with the same letter. For example, switching the n's with each other in "noun" does not give an anagram.
Even though a word is not considered an anagram of itself, your task is to find a word that is an anagram of itself. If you can do the seemingly impossible once, you might as well find a second word that is an anagram of itself.
trick (there that better?) just teasing you Ruby
-- Edited by gable875 on Monday 6th of July 2009 12:08:08 PM
__________________
May your troubles be less,may your blessings be more,and may nothing but happiness come through your door
