C++ please I need it ASAP

A string S is called palindome if it reads same way if spelled backwards, for example: "nolemonnomelon, ASANtaLivedAsAdevilatNASA Any non-empty string has substrings that are palindromes. For example, in the string S "hellolle, there are many of such "subparlindromes" 1) ellolle 2) IN, II note that these are two distinct substrings that only happen to be equa 3) tol and Biol 4) And, of course, each letter can be considered a palindrome- all 8 of them. Write a function that, given a string S (that only consists of lowercase English letters), counts how many difflerent ways are there to pick a palindrome substring from S Examples 1. Input: hellolle output: 13 (the above example) 2 Input: wowpurerocks output: 14 (each letter wow "rer YOUR ANSWER We recommend you take a quick tour of our editor before you proceed. The timer will pause up to 90 seconds for t Start tou O For help on how to read input and write output in C++,dlick here Original code C 611Complete the count palindrones function below int count palindrones(string s) ( O Type here to search