diff --git a/src/teaching/cse-250/2022fa/slide/20b-Review.erb b/src/teaching/cse-250/2022fa/slide/20b-Review.erb
index 8c7e99e1..da29883f 100644
--- a/src/teaching/cse-250/2022fa/slide/20b-Review.erb
+++ b/src/teaching/cse-250/2022fa/slide/20b-Review.erb
@@ -226,11 +226,11 @@ scala> println(s.mkString(", ")
   <p>$f(n) \in O(g(n))$ iff...</p>
 
   <dl>
-    <dt>$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
-    <dd>There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt style="color: #ddd;">$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
+    <dd style="color: #ddd;">There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
 
-    <dt style="color: #ddd;">$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
-    <dd style="color: #ddd;">There is some $c_{high}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> smaller than $c_{high}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt>$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
+    <dd>There is some $c_{high}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> smaller than $c_{high}g(n)$ for values of $n$ above some $n_0$</dd>
   </dl>
 </section>
 
@@ -240,11 +240,11 @@ scala&gt; println(s.mkString(", ")
   <p>$f(n) \in \Omega(g(n))$ iff...</p>
 
   <dl>
-    <dt style="color: #ddd;">$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
-    <dd style="color: #ddd;">There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt>$\exists c_{low}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \geq c_{low}\cdot g(n)$</dt>
+    <dd>There is some $c_{low}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> bigger than $c_{low}g(n)$ for values of $n$ above some $n_0$</dd>
 
-    <dt>$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
-    <dd>There is some $c_{high}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> smaller than $c_{high}g(n)$ for values of $n$ above some $n_0$</dd>
+    <dt style="color: #ddd;">$\exists c_{high}, n_{0}$ s.t. $\forall n > n_{0}$, $f(n) \leq c_{high}\cdot g(n)$</dt>
+    <dd style="color: #ddd;">There is some $c_{high}$ that we can multiply $g(n)$ by so that $f(n)$ is <u>always</u> smaller than $c_{high}g(n)$ for values of $n$ above some $n_0$</dd>
   </dl>
 </section>
 
@@ -426,8 +426,8 @@ scala&gt; println(s.mkString(", ")
     </tr>
 
     <tr>
-      <td>$O(n)$</td>
       <td>remove</td>
+      <td>$O(n)$</td>
       <td>$O(n)$ or $O(n-i)$</td>
       <td>$O(n)$ or $O(i)$</td>
       <td>$O(1)$</td>