1- Write a recursive function to determine a given two strings are anagram or not.
Example anagram words:
Listen = Silent
Elvis = Lives
Admirer = Married