diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/baboon-crossing.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/baboon-crossing.wiki
index b705dc32..a6370b4b 100644
--- a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/baboon-crossing.wiki
+++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/baboon-crossing.wiki
@@ -15,7 +15,7 @@ The system may be workable, but it is certainly not perfect. You can easily imag
 
 # If two baboons meet in the middle of the rope, then all activity stops, and no other baboons can cross (deadlock). So, at any given time, all the baboons on the rope must be going the same direction.
 # The rope can hold only a certain number of baboons at a time. A baboon cannot be allowed on the rope if the rope is already at full capacity.
-# A continuous stream of baboons from one direction could prevent baboons wanting to go the opposite direction from ever being able to cross (starvation).  
+# A continuous stream of baboons from one direction could prevent baboons wanting to go the opposite direction from ever being able to cross (unfairness, starvation).  
 
 
 =Highlights=
diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/search-insert-delete.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/search-insert-delete.wiki
new file mode 100644
index 00000000..85d90ccc
--- /dev/null
+++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/search-insert-delete.wiki
@@ -0,0 +1,20 @@
+[[Property:title|Search-insert-delete]]
+[[Property:weight|-9]]
+[[Property:uuid|0d7035db-2e00-602b-b7eb-78f0ad55b9a6]]
+{{UnderConstruction}}
+
+
+{{Beta}}
+
+
+=Description=
+
+
+
+
+=Highlights=
+
+
+
+
+