Time complexity of sieve based approach?

#1

Please explain the time complexity of sieve base approach as i am not able to understand how it is O (log log n)

#2

hello @namangarg31
pls refer this article for the proof -> https://www.geeksforgeeks.org/how-is-the-time-complexity-of-sieve-of-eratosthenes-is-nloglogn/