USING C++:

A sequence is called a palindromic sequence if it reads the same front to back as back to front (i.e, reversing the sequence does not change it). Examples of palindromic sequences:

{1,2,13,13, 2,1} {"it", "is", "cold", "is", "it"} {'r', 'a', 'c', 'e', 'c', 'a', 'r'}

Write a template function called isPalindromic that given a sequence as a dynamic array it will return true if the sequence is palindromic. The function should take as arguments (in this order):

• a pointer to the array (i.e., dynamic array)
• the size of the array

The function should return

• true/false depending if the entries in the array form a palindromic sequence.