fix: implement suggestions from code review

Author: vaeng

exercises/relative-distance/instructions.md

@@ -3,7 +3,7 @@
 Your task is to determine the degree of separation between two individuals in a family tree.
 
 - You will be given an input, with all parent names and their children.
-- Each name is unique, a child _can_ have one or more parents.
+- Each name is unique, a child _can_ have one or two parents.
 - The degree of separation is defined as the shortest number of connections from one person to another.
 - If two individuals are not connected, return a value that represents "no relation."
   Please see the test cases for the actual implementation.
@@ -28,7 +28,7 @@ Given the following family tree:
 ```
 
 The degree of separation between Tariq and Uma is 3 (Tariq → Helena → Isla → Uma).
-The degree of separation between Isla and [Kevin][six-bacons] is not defined, as there is no visible relationship in the given data.
+There's no known relationship between Isla and [Kevin][six-bacons], as there is no connection in the given data.
 The degree of separation between Uma and Isla is 1.
 
 [six-bacons]: https://en.m.wikipedia.org/wiki/Six_Degrees_of_Kevin_Bacon