7 files changed, 9 insertions, 7 deletions
diff --git a/challenge-094/adam-russell/blog.txt b/challenge-094/adam-russell/blog.txt
index e69de29bb2..2f7058c563 100644
--- a/challenge-094/adam-russell/blog.txt
+++ b/challenge-094/adam-russell/blog.txt
@@ -0,0 +1 @@
+http://www.rabbitfarm.com/cgi-bin/blosxom/perl/2021/01/10  
diff --git a/challenge-094/adam-russell/blog1.txt b/challenge-094/adam-russell/blog1.txt
index e69de29bb2..ada9039f92 100644
--- a/challenge-094/adam-russell/blog1.txt
+++ b/challenge-094/adam-russell/blog1.txt
@@ -0,0 +1 @@
+http://www.rabbitfarm.com/cgi-bin/blosxom/prolog/2021/01/10 
diff --git a/challenge-094/adam-russell/perl/LinkedList.pm b/challenge-094/adam-russell/perl/LinkedList.pm
index e3e7c28dc0..4904277619 100644
--- a/challenge-094/adam-russell/perl/LinkedList.pm
+++ b/challenge-094/adam-russell/perl/LinkedList.pm
@@ -54,4 +54,4 @@ package LinkedList{
         return false;
     }
     true;
-}
+}   
diff --git a/challenge-094/adam-russell/perl/ch-1.pl b/challenge-094/adam-russell/perl/ch-1.pl
index 96e8508434..6071a2dd78 100644
--- a/challenge-094/adam-russell/perl/ch-1.pl
+++ b/challenge-094/adam-russell/perl/ch-1.pl
@@ -4,7 +4,7 @@ use warnings;
 # You are given an array of strings @S.
 # Write a script to group Anagrams together 
 # in any random order.
-##
+##   
 my %letter_factor = (
     e => 2,
     t => 3,
diff --git a/challenge-094/adam-russell/perl/ch-2.pl b/challenge-094/adam-russell/perl/ch-2.pl
index 42b58780d9..6195d96af4 100644
--- a/challenge-094/adam-russell/perl/ch-2.pl
+++ b/challenge-094/adam-russell/perl/ch-2.pl
@@ -5,7 +5,7 @@ use warnings;
 # represent the given binary tree as an object and 
 # flatten it to a linked list object. 
 # Finally, print the linked list object.
-##
+##  
 use Graph;
 use LinkedList;
 
diff --git a/challenge-094/adam-russell/prolog/ch-1.p b/challenge-094/adam-russell/prolog/ch-1.p
index 80a0c5341f..e51c83c5f2 100644
--- a/challenge-094/adam-russell/prolog/ch-1.p
+++ b/challenge-094/adam-russell/prolog/ch-1.p
@@ -1,6 +1,6 @@
 /*
 * You are given a list of strings S.
-* Write a script to group Anagrams together 
+* Write a script to group Anagrams together  
 * in any random order.
 */
 :-initialization(main).
diff --git a/challenge-094/adam-russell/prolog/ch-2.p b/challenge-094/adam-russell/prolog/ch-2.p
index d417c95188..09794ed81b 100644
--- a/challenge-094/adam-russell/prolog/ch-2.p
+++ b/challenge-094/adam-russell/prolog/ch-2.p
@@ -1,6 +1,6 @@
 /* 
 * You are given a binary tree. Write a script to 
-* represent the given binary tree as an object and 
+* represent the given binary tree as an object and   
 * flatten it to a linked list object. 
 * Finally, print the linked list object.
 */
@@ -40,6 +40,6 @@ print_list([H|T]):-
     print_list(T).
 
 main:-
-    findall(Path0, dfs(1,[r(1,[2]),r(1,[3]),r(2,[4,5]),r(5,[6,7])], Path0), Paths0),
-    paths_list(Paths0, List),  
+    findall(Path, dfs(1,[r(1,[2]),r(1,[3]),r(2,[4,5]),r(5,[6,7])], Path), Paths),
+    paths_list(Paths, List),  
     print_list(List), halt.