write a program in python that does the detects if a string is a boo

using recursion

we'll say that a string is an "boo" if its length is 3, and if the last two characters are equal. Thus:

• "boo" is an boo
• "bee" is an boo
• "922" is an boo
• "777" is an boo (doesn't matter that the first character is different!)
• "kit" is not an boo (last two characters not equal)
• "atmosphere" is not an boo (because length not equal to 3)
• "By" is not an bee (length not equal to 3)
• "j" is not an bee(length not equal to 3)

returns true if string is an boo

otherwise return false

using recursion or iteration