The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s.int anagram (char *a, char *b){int count [128], j;for (j = 0; j < 128; j++)count[j]=0;j = 0;while (a[j] && b[j]){ A; B;}for (j = 0; j < 128; j++)if (count[j])return 0;return 1;}Choose the correct alternative for statements A and B.

• A. A: count [a[j]]++ and B: count[b[j]]--
• B. A: count [a[j]]++ and B: count[b[j]]++
• C. A: count [a[j++]]++ and B: count[b[j]]--
• D. A: count[a[j]]++ and B: count [b[j++]]--