I have done this question in o(n*sqrt(n)) rell me if i have to do use better solution

#1

please tell me my last two test cases are not passed

#2

Please use sqrt(n) only to solve the above problem. Initially divide the number by 2 if it does, and then use the seive technique to do further prime factorisastion by looping from 3 to sqrt(n) and subsequently dividing n by i until it does.