Given the following heap class, which method should be implemented to ensure that elements are sifted up or sifted down?
a) Insert
b) RemoveTop
c) Both a and b
d) None of the above