diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 000000000..f6ef8a438
Binary files /dev/null and b/.DS_Store differ
diff --git a/starter-code/functions-and-arrays.js b/starter-code/functions-and-arrays.js
index 039bef297..ec8a2c0be 100644
--- a/starter-code/functions-and-arrays.js
+++ b/starter-code/functions-and-arrays.js
@@ -1,14 +1,34 @@
 // Find the maximum
 function maxOfTwoNumbers (first, second) {
-
+  if (first>second){
+    console.log ("first");
+  }
+  else if (second>first){
+    console.log ("second");
+  }
+  else {
+    console.log("the numbers are the same");
+  }
 }
 
 var largest = maxOfTwoNumbers(2, 6);
 console.log(largest);
 
 // Finding Longest Word
-function findLongestWord (words) {
 
+function findLongestWord (words) {
+    var biggest="";
+    for ( var ix=0; ix < words.length; ix++){
+      if ( biggest.length < words[ix].length){
+        biggest=words[ix];
+      }
+    }
+    for ( var j=0; j<words.lenght; j++){
+      if (biggest.length==words[j].length){
+        console.log (words[j]);
+      }
+    }
+    console.log(biggest);
 }
 
 var words = [
@@ -20,12 +40,16 @@ var words = [
   "orchard",
   "crackpot"
 ];
+
 var longest = findLongestWord(words);
 console.log(longest);
 
 // Calculating a Sum
 function sumArray (array) {
-
+  var totalSum=0;
+  array.forEach(function(number){
+      totalSum+=number;
+    });
 }
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
@@ -34,7 +58,11 @@ console.log(total);
 
 // Calculate the Average
 function averageNumbers (array) {
-
+  var totalSum=0;
+  array.forEach(function(number){
+      totalSum+=number;
+    });
+    return totalSum/array.length;
 }
 
 var numbers = [2, 6, 9, 10, 7, 4, 1, 9];
@@ -43,9 +71,14 @@ console.log(average);
 
 // Array of Strings
 function averageWordLength (array) {
-
+  var total=0;
+  array.forEach(function(number){
+      total+=number.length;
+    });
+    return total/array.length;
 }
 
+
 var words = [
   "seat",
   "correspond",
@@ -63,9 +96,14 @@ console.log(averageLength);
 
 // Unique Arrays
 function uniquifyArray (array) {
-
+    var newarray=[];
+    for ( var ix=0; ix < array.length; ix++){
+        if ( newarray.indexOf(array[ix])===-1 ){
+          newarray.push(array[ix]);
+        }
+    }
+    return newarray;
 }
-
 var words = [
   "crab",
   "poison",
@@ -84,7 +122,12 @@ console.log(uniqued);
 
 // Finding Elements
 function doesWordExist (wordsArray, word) {
-
+  var biggest="";
+  for ( var ix=0; ix < words.length; ix++){
+    if ( biggest.length < words[ix].length){
+      biggest=words[ix];
+    }
+  }
 }
 
 var words = [
diff --git a/starter-code/words.html b/starter-code/words.html
new file mode 100644
index 000000000..580afa467
--- /dev/null
+++ b/starter-code/words.html
@@ -0,0 +1,22 @@
+<script>
+function findLongestWord (words) {
+    var LongestWord="";
+    words.forEach(function(word){
+      if(word.lenght>longestWord.lenght){
+        longestWord = word;
+      }
+    });
+    return longestWord;
+  }
+    
+
+var words = [
+  "mystery",
+  "brother",
+  "aviator",
+  "crocodile",
+  "pearl",
+  "orchard",
+  "crackpot"
+];
+</script>