solution.md

The solution is short, yet may look a bit tricky, so here I provide it with extensive comments:

let sortedRows = Array.from(table.tBodies[0].rows) // 1
  .sort((rowA, rowB) => rowA.cells[0].textContent.trim().localeCompare(rowB.cells[0].textContent.trim())); // 2

table.tBodies[0].append(...sortedRows); // 3

The step-by-step algorthm:

1. Get all <tr>, from <tbody>.
2. Then sort them comparing by the content of the first <td> (the name field).
3. Now insert nodes in the right order by .append(...sortedRows).

We don't have to remove row elements, just "re-insert", they leave the old place automatically.

Tables always have an implicit <tbody> element, so we need to get it and insert into it: a simple table.append(...) will fail.