For this Question: Given a string S find minimum number of changes required to make the string palindrome. In a change you can change any index of the string to any character.
A palindrome is a string that remains the same if reversed.First and only line of input contains a string S.

Constraints
1 <= |S| <=  100000
S contains only lowercase lettersOutput a single integer which is the minimum number  of changes required to make string palindrome.sample input 1
abc

sample output 1
1

sample input 2
abcdef

sample output 2
3
, I have written this Solution Code: function palindrome(s) {
    // write code here
    // do not console.log
    // return the number of changes

    const n = s.length;

    let cc = 0;

    for (let i = 0; i < n / 2; i++) {

        if (s[i] == s[n - i - 1])
            continue;


        cc += 1;

        if (s[i] < s[n - i - 1])
            s[n - i - 1] = s[i];
        else
            s[i] = s[n - i - 1];

    }
    return cc;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not?