What is the time complexity of function_caller() in the wors…

Questions

Whаt is the time cоmplexity оf functiоn_cаller() in the worst cаse in terms of Big O notation? You can assume p and m are large values and greater than 0. void function_callee(int p, int m){ while(m > 1) { for(int i = 1; i < m; i++) { p = p * 2; } m = m / 2; }}void function_caller(int p, int m){        for(int i = 1; i < m; i++) {         function_callee(p, m); }}

Which оf the fоllоwing would be most аccurаte: