Yes to all of them. Write the coins used as m coins of +13 and n coins of –9, so the total is 13m – 9n.
How to find these. Follow the book’s hint and write out multiples of 13 and of 9, then look for two that differ by the amount you want.
Multiples of 13: 13, 26, 39, 52, 65, 78, 91, 104, 117, 130, …
Multiples of 9: 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, …
(d) +8: 26 – 18 = 8 → 2 coins of +13 and 2 coins of –9
(e) +10: 91 – 81 = 10 → 7 coins of +13 and 9 coins of –9
(g) +1: 91 – 90 = 1 → 7 coins of +13 and 10 coins of –9
(h) Once +1 can be made, every amount can be made. But repeating the +1 recipe 1568 times needs a huge pile of coins, so search directly instead. Look for a multiple of 13 that is 1568 plus a multiple of 9. Since 1568 = 122 × 13 – 18,
122 × 13 = 1586
1586 – 1568 = 18 = 2 × 9
So 1568 = 122 coins of +13 and 2 coins of –9
Why it happens: 13 and 9 have no common factor other than 1. Because of that, some combination 13m – 9n hits 1 exactly, and once you can build 1 you can build any integer at all by repeating. If the two coins had been, say, +12 and –9, every total would be a multiple of 3 and amounts like 85 would be impossible.
Tip: the answers above are not the only ones. Adding 9 more +13 coins and 13 more –9 coins changes the total by 9 × 13 – 13 × 9 = 0, so you can always pad a solution.