this question should be solved with c #

Task 4 C# Files 1 You are given an implementation of a function: task4 solution.cs class solution { public string solution(string s); } test-input.txt 6 that, given a non-empty string consisting of N lowercase English letters, returns the character which occurs most frequently in the string. If more than one character satisfies this requirement, the function should return the earliest alphabetically. For example, if both c and d are the most frequent letters, then the answer is c. For example, given a string: S = "hello" the function should return "1". It appears twice in S. No other characters appear as frequently. The attached code is still incorrect for some inputs. Despite the error(s), the code may produce a correct answer for the example test cases. The goal of the exercise is to find and fix the bug(s) in the implementation. You can modify at most four lines. Write an efficient algorithm for the following assumptions: N is an integer within the range [1..100,000); string S consists only of lowercase letters (a-z). solution.cs X 1 using System; 2 2 3 3 class Solution { 4 4 public String solution(String s) { 5 5 int[] occurrences = new int[26]; 6 foreach (char ch in s) { 7 7 occurrences[(int)ch - 'a']++; 8 8 } 9 9 10 10 char best_char = 'a'; 11 11 int best_res = 0; 12 12 13 13 for (int i = 1; i = best_res) { 15 15 best_char = (char) ('a' + i); 16 16 best res = occurrences[i]; 17 17 } 18 18 } 19 19 20 20 return best_char.ToString(); 21 21 } 22 22 } 23 II 23