Convert "Travellers" to typst

src/Warm-Ups/Mario Kart/main.typ

@@ -33,7 +33,7 @@ What is the largest possible $n$, and how is it achieved?
 
   A 11-way tie is possible, with a top score of 28:
   - Four players finish $1^#text("st")$, $3^#text("ed")$, $11^#text("th")$, and $12^#text("th")$;
-  - Four players finish $2^#text("nd")$, $4^#text("th")$, $9^#text("th")$, and $10^#text("th")$; // spell:disable-line
+  - Four players finish $2^#text("nd")$, $4^#text("th")$, $9^#text("th")$, and $10^#text("th")$;
   - Two players finish fifth twice and seventh twice,
   - One player finishes sixth in each race.
   The final player always finishes eighth, with a non-tie score of 20.

src/Warm-Ups/Regex/main.typ

@@ -62,7 +62,7 @@ Brackets `{min, max}` are the most flexible quantifier. \
 They specify exactly how many tokens to match: \
 `ab{2}a` will match only `abba`. \
 `ab{1,3}a` will match only `aba`, `abba`, and `abbba`. \
-`ab{2,}a` will match any `ab...ba` with at least two `b`s. // spell:disable-line
+`ab{2,}a` will match any `ab...ba` with at least two `b`s.
 
 #problem()
 Write the patterns `a*` and `a+` using only `{ }`.