Write a function$$palindrome$\_$re$($n$)$that takes a number$$n$$and returns a regular expression that matches strings that are palindromes of length n$.$ Your regular expression can use whatever capturing groups you like$---$we'll only be checking whether or not it matches, not what it captures.

$>>>$ r $=$ palindrome$\_$re$(5)$

$>>>$ bool$($re$.$fullmatch$($r$,$ 'abcba'$))$

True

$>>>$ bool$($re$.$fullmatch$($r$,$ 'abcbd'$))$

False

$>>>$ bool$($re$.$fullmatch$($r$,$ 'eeeee'$))$

True

$>>>$ bool$($re$.$fullmatch$($r$,$ 'racecar'$))$

False

$>>>$ bool$($re$.$fullmatch$($r$,\text{'}$#$..$#$\text{'}))$

True create a function such that it checks the first character of string is same as the last $,$ second character as second last, third as third last and so on to check if its palindrome