Given a string s, count how many times the i-th character from the front equals the i-th character from the back. For example, the count for the string 'abcdefcba' is 3. If the string length is odd, do not count the middle character as a match.

Complete the following file:

prog.cpp

#include <iostream> #include <string> using namespace std; int countFrontBackMatches(string s) { int count = 0;
return count; }