Node of a B- Tree is stored in memory block and Traversing a B-tree involves __ page faults. (A) O (n^2) (B) O (n) (C) O (n log n) (D) O (log n)â–ºCorrect Option Correct Option is: D