fix: add note to task 1

assignment-4/handin.md

@@ -23,3 +23,7 @@ the algorithm performs halving, but readds all experts if all should be removed.
 when there is no such expert that never makes mistakes, we can see that the algorithm makes at most $(1 + m^*)(1 + \log_2 n) - 1$ mistakes, where $m^* = \min m_i^T$.
 
 once again, when the algorithm makes a mistake, at least half of the experts are booted, and similarly for when we choose correctly. however, we have no guarantee this time, thus we could end up booting all experts at the first turn. as such, we need 
+
+---
+
+haven't touched this since before easter so i'm not gonna bother finishing it