Coursework 2

(a) Anagram Tester

Write a Boolean valued function anagrams(s1, s2), which returns true just in case the string s1 contains the same letters as string s2 but in a different order. The function should be case insensitive --- in other words it should return the same value if any letters in either s1 or s2 are changed from upper to lower case or from lower to upper case. You may assume that the input strings contain only letters.

Examples
INPUT 1 (string) INPUT 2 (string) OUPUT (boolean)

sidebar seabird True

cheese frizbee False

listen silent True

this this False

Tar Rat True

Tar TAR False

Examples
INPUT 1 (string)	INPUT 2 (string)	OUPUT (boolean)
sidebar	seabird	True
cheese	frizbee	False
listen	silent	True
this	this	False
Tar	Rat	True
Tar	TAR	False