\(\mathsf {OR}\)  and Parity (\(\mathsf {\oplus }\) ) are one of the simplest functions, probably the first ones to be studied for any complexity measures. The bounds on \(\mathsf {\oplus }_n\)  follow from the observation that \(\lambda (\mathsf {\oplus }_n) = \Theta (n)\)  (\(\mathsf {CG}(\mathsf {\oplus }_n) = \Theta (n^2)\)  follows from Theorem REF ); the bounds on \(\mathsf {OR}_n\)  follow from \(\lambda (f) = \Theta (\sqrt{n})\)  [1]}, \(\mathsf {Q}(\mathsf {OR}_n) = O(\sqrt{n})\)  [2]} and the observation that \(\mathsf {s}(\mathsf {OR}_n) = \Theta (n)\)  (please refer to Figure REF ).
