I need help please with this question regarding Sorting Analysis in C++, The question is: Why is Radix sort unrelated to the F(n)=O(nlog⁡n) family of sorting algorithms?

Can someone help me with this question in C++ and not any other programming language No library functions that leverage hash and maps can be used except to make it all lowercase  List sentence(s) with the maximum no. of occurrences of the word "the" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "of" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "was" in the entire file and also list the corresponding frequency. here is a link too the file its called tiny1 https://drive.google.com/file/d/1ariNN_rW9c3vijK1hvjObcQJafYQ2gzm/view?usp=sharing

binary search c++ recursive

Implement a C++ program to store Strings in Binary Search tree. Your program should have following functions: Insert Display Search Data structures in C++