I need a program written called anagram which looks inside a file called "word.h" or "[login to view URL]" and places all the words in this file inside an array. Then place the same words in a second array but arrange each word in alphabetical order(not the whole file just the word) and without punctuation example: Man's - amns low - low Pots - opst stop - opst it's - ist sit - ist After this is done then take the words that have matching letters on the list and place them inside a third array to match the 1st and original array...an anagram. , example: Man's - low - Pots - Stop Stop - Pots it's - sit sit - it's (Stop is an anagram of pots, sit is an anagram of it's) *Treat upper and lower case the same. But show orginal form in final array. *No word can be longer then 15 letters and no file more then 50 words. If file has 52 words then and 2 words are more then 15 letters the file is only 50 words. *If file is more then 50 words display "file too Big". *if input file is empty disply "empty file" and end program. * If possible display the mathing words just once instead of twice. Man's - low - it's - sit Pots - Stop
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
## Platform
Microsoft Windows environment us the Visual C++