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

using recursion

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

• "bee" is an bee
• "gee" is an bee
• "966" is an bee
• "333" is an bee (no requirement that the first character is different!)
• "bit" is not an bee (last two characters not equal)
• "important" is not an bee (because length not equal to 3)
• "to" is not an bee (length not equal to 3)
• "k" is not an bee(length not equal to 3)

Function name is bee.

The output will say true if it bee and false if its not