Definition: In this task, you are given an input list A. You need to convert all the alphabets in the list with a number representing their position in the English alphabet. E.g., replace A by 1, B by 2, a by 1, b by 2, and so on.
Input: ['k', 'G', 'x', '5311', '9679', 'A', 'a', 'E', 'h', 'W', 'M', 'g', '2307', 'd', 'E', 'd', '3015', 'Z', '5339', 'N', '3689', '7469', '5587', '4345', 'B', 'A', 'E', 'j', '6939', 'y', '797', 'A', '8095', 'g']

11, 7, 24, 5311, 9679, 1, 1, 5, 8, 23, 13, 7, 2307, 4, 5, 4, 3015, 26, 5339, 14, 3689, 7469, 5587, 4345, 2, 1, 5, 10, 6939, 25, 797, 1, 8095, 7