Problem
1. Create 1D array of integers of size 26 called alphArray.
2. Ask the user to input a sentence s.
3. Write case-insensitive function that receives the array alphArray and the sentence s and then fills the array with the number of occurrences each English alphabet letter appears in s. Each element in alphArray corresponds to such letter. Ignore all non-alphabet letters found in s.
4. In your solution, avoid using a set of nested if/else(s) to figure out for which alphabet letter a certain character in s corresponds. A simple game of math does the job (can you guess what it's?).
5. Once done, print the English alphabet letters (each on a separate line) and next to it how many times it appears in s. Ignore any alphabet letter whose count is zero. In the example below, the output ignores printing the alphabet letter f, j, k. p, q, u, v, x, and z since they don't show up in s at all.