diff --git a/chapter02/worksheets/solution2.1.7.5.scala b/chapter02/worksheets/solution2.1.7.5.scala
index 0eb85d0..aa9f81d 100644
--- a/chapter02/worksheets/solution2.1.7.5.scala
+++ b/chapter02/worksheets/solution2.1.7.5.scala
@@ -1,3 +1,11 @@
+/** author: Andreas Röhler */
+
+/** 
+Exercise 2.1.7.5 Given p: Seq[String] and q: Seq[Int] of equal length, compute a Seq[String] that
+contains the strings from p ordered according to the corresponding numbers from q. For example, if
+  p = Seq("a", "b", "c") and q = Seq(10, -1, 5) then the result must be Seq("b", "c", "a").
+  */
+
 val p = Seq("a", "b", "c")
 val q = Seq(10, -1, 5)