Make these two paragraphs conform.

Author: coke

doc/Language/concurrency.rakudoc

@@ -240,11 +240,14 @@ At its simplest, a L<C<Supply>|/type/Supply> is a message stream that can have
 multiple subscribers created with the method C<tap> on to which data items can
 be placed with C<emit>.
 
-The L<C<Supply>|/type/Supply> can either be C<live> or C<on-demand>. A C<live>
+There are two types of Supplies: C<live> and C<on demand>. A C<live>
 supply is like a TV broadcast: those who tune in don't get previously emitted
-values. An C<on-demand> broadcast is like Netflix: everyone who starts streaming
-a movie (taps a supply), always starts it from the beginning (gets all the
-values), regardless of how many people are watching it right now. Note that no
+values. An C<on-demand> broadcast is like a video streaming service:
+everyone who starts streaming a movie (taps a L<C<Supply>|/type/Supply>),
+always starts it from the beginning (gets all the values),
+regardless of how many people are watching it right now.
+
+Note that no
 history is kept for C<on-demand> supplies, instead, the C<supply> block is run
 for each tap of the supply.
 

doc/Type/Supply.rakudoc

@@ -18,7 +18,7 @@ and central to supporting reactive programming in Raku.
 There are two types of Supplies: C<live> and C<on demand>. A C<live>
 supply is like a TV broadcast: those who tune in don't get previously emitted
 values. An C<on-demand> broadcast is like a video streaming service:
-everyone who starts streaming a movie (taps a supply),
+everyone who starts streaming a movie (taps a C<Supply>),
 always starts it from the beginning (gets all the values),
 regardless of how many people are watching it right now.