Develop a case-sensitive pseudocode C programming algorithm for reading a palindrome

Develop a case-sensitive algorithm to determine if a character array of length n encodes a palindrome, that is, which reads the same forward and backward. For example, a "racecar" is a palindrome.

Write the algorithm in pseudocode. C programming

Analyse the time complexity of your algorithm.
The late penalty is a per-hour mark reduction equal to 0.2% of the max assessment mark, for up to 5 days, after which submissions will no longer be accepted.

The exercise is worth 2 marks.
Submissions will be auto-marked after the late penalty deadline has passed.
It is important that the output of your program follows exactly the format of the sample output, otherwise auto-marking will result in 0 marks.
Group submissions will not be allowed. Your programs must be entirely your own work. Plagiarism detection software will be used to compare all submissions pairwise (including submissions for similar assessments in previous years, if applicable) and serious penalties will be applied, including an entry on UNSW's plagiarism register.

Do not copy ideas or code from others
Do not use a publicly accessible repository or allow anyone to see your code