name$($n$)$

name.substring$($n$,1)$

mid$($name$,$ n$,0)$

In VB$.$Net write a programe For the two given strings, check if one is an anagram of the other.

Hint: the simplest way is to put all the letters in order in both strings

Hint: a nicer way is to make a frequency table $($using an array$)$ for the letter frequencies in each string: one for the first string, one for the second string, then check if all the letter frequencies are the sam