Problem Statement

Make Alphabetically Smallest Palindrome Problem Description A palindrome reads the same from either direction, e.g., 'ede'. Given a string of lowercase English letters, determine how to change it in the fewest possible letters to form a palindrome after which, if multiple palindromes are possible with the same number of changes, return the alphabetically smallest one. Function Description Complete the function makeAlphabeticallySmallestPalindrome in the editor with the following parameter: string s : the string Returns string : the alphabetically smallest palindromic string that can be obtained by changing a minimum number of characters Examples Example: s = "azzbzzb" Optimally, change one 'z' to 'a' to get "aazzbba". This can be rearranged to form "abzbzba", which is the alphabetically smallest palindrome possible after 1 change. Other palindromes are possible with 1 change, such as "azbbza" or "zzbbzz", but "abzbzba" is alphabetically smallest. Sample Case 0: Input: s = "fhaigh" Outp