To build a heap from a sequence of N items using the Insert method, the time complexity is:

O$($N$)$

O $($NigN$)$

O $($IgN$)$

OO $($N$2)$