for(i=1;i<=n;i++){
for(j=i;j<=n;j+=i){
sum+=i;
}
}

what is time complexity of above question ??

can we solve n<=10^7 constraints by this algo??

provide more resource to analyze time complexity much more complex…??***