Consider the following two loops: // Loop A for (i = 1; i <= n; i++) for (j = 1; j <= 10000; j++) sum = sum + j; // Loop B for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) sum = sum + j; Although Loop A is O(n) and Loop B is O(n2), Loop B can be faster than Loop A for small values of n. Design and implement an experiment to find a value of n for which Loop B is faster.

Implement a document scanning function wordcountengine, which receives a string document and returns a list of all unique words in it and their number of occurrences, sorted by the number of occurrences in a descending order. if two or more words have the same count, they should be sorted according to their order in the original sentence. assume that all letters are in english alphabet. you function should be case-insensitive, so for instance, the words “perfect” and “perfect” should be considered the same word.