Not solved

  

Problem 7: Find a tight upper bound on the complexity of the below program: 
 

• CPP

void function(int n) {     int count = 0;     for (int i=0; i<n; i++)         for (int j=i; j< i*i; j++)             if (j%i == 0)             {                 for (int k=0; k<j; k++)                     printf("*");             }