$10$

Problem $8($Ledgers or Ladders?!$).$ A ledger starts from $0$ and gains one dollar for each $+$ and loses one dollar for each $-.$ Reading left to right, check that the account never goes into the negative. For example,

Accept:,,,$+++++++++++++++++$ Reject:,,,$+-++++++($Note: there is a reason this problem is right after parentheses nesting $-$ they are very similar problems!$)$ a$.$ Describe how a Turing machine, Ledger, would accept the string $++-+--+.$

$\backslash$table$[[cdots,,,7,=,$f$,=,-,7,,$cdots