Hi guys I need the function in my C++ code here called analyzeDividors() to be run Theta-N times total for running time. The code is for calculating all amicable numbers from 2 to a user inputted number M. Currently in my code, I call it Theta-M^2 times but cant seem to write code that works where it runs in Theta-M running time. No need to pay attention to the running time of any of the other called functions here, simply the amount of times analyzeDividors() is called. Anyways, help me write code for this in Theta-N. Thanks! Here is my code. And under it is the original question.

int main() int outCountDivs, outSumDivs,m; outCountDivs 0 outSumDivs-; cout