Complexity Advanced algorithms exercise

1 Complexity In a language whose alphabet is composed of N different symbols, we consider a text of length M (i.e. made of M symbols). We want to analyse the relative frequency of each symbol in the text. 1. Write an algorithm that computes the number of occurrences of each symbol of the alphabet in the text (you can consider the text as an array of M symbols). 2. What is the complexity of your algorithm