$4$ Show how to implement GREEDY$-$SET$-$Cover approximation algorithm in such a way that it runs

in time $O({\displaystyle \underset{\text{S}\text{i}\text{n}\text{F}}{\overset{?}{}}}|S|).$ Prove that your implementation indeed has the specified time complexity.