Format all instructions.append.md to start with an H1 (required but ignored) and H2

exercises/practice/anagram/.docs/instructions.append.md

@@ -1,3 +1,5 @@
 # Instructions Append
 
+## Implementation
+
 The anagrams can be returned in any order.

exercises/practice/atbash-cipher/.docs/instructions.append.md

@@ -1,3 +1,5 @@
-# Note
+# Instructions append
+
+## Note
 
 The tests for this problem assume that numbers are passed through without being encrypted/decrypted.

exercises/practice/binary-search/.docs/instructions.append.md

@@ -1,6 +1,9 @@
 # Instructions append
 
-In Racket, this exercise uses sorted [vectors] rather than lists because vectors support constant-time access of its elements. Like several other Lisp tracks, when an item isn't present in the vector, the expectation is that the [Boolean literal `#f`][booleans] will be returned rather than raising an exception. 
+## Implementation
+
+In Racket, this exercise uses sorted [vectors] rather than lists because vectors support constant-time access of its elements.
+Like several other Lisp tracks, when an item isn't present in the vector, the expectation is that the [Boolean literal `#f`][booleans] will be returned rather than raising an exception. 
 
 [vectors]: https://docs.racket-lang.org/guide/vectors.html
 [booleans]: https://docs.racket-lang.org/reference/booleans.html

exercises/practice/perfect-numbers/.docs/instructions.append.md

@@ -1,5 +1,5 @@
-# Implementation
+# Instructions append
 
-Implement a procedure named `classify` that takes a number as argument and returns either `'perfect`,
-`'abundant`, or `'deficient`.
+## Implementation
 
+Implement a procedure named `classify` that takes a number as argument and returns either `'perfect`, `'abundant`, or `'deficient`.

exercises/practice/robot-name/.docs/instructions.append.md

@@ -1,3 +1,5 @@
-# Note
+  # Instructions append
+
+## Note
 
 For this problem, you will need to write the test.