diff --git a/package.json b/package.json
index f6a9988..999ca7a 100644
--- a/package.json
+++ b/package.json
@@ -4,11 +4,12 @@
   "license": "UNLICENSED",
   "scripts": {
     "test": "jest",
+    "start": "node index.js",
     "test:watch": "jest --watchAll --verbose=false"
   },
   "devDependencies": {
     "jest": "^26.6.3",
-    "jest-html-reporter": "^3.3.0",
+    "jest-html-reporter": "^3.10.2",
     "jest-junit": "^12.0.0"
   },
   "jest": {
diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec..4089f11 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,24 +1,71 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
-
+function maxOfTwoNumbers(number1,number2) {
+  if(number1>=number2){
+    //console.log(`${number1} is maximum `);
+    return number1;
+  
+  
+  }else{
+   //console.log( `${number2} is maximum`);
+   return number2;
+  }
+}
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
-
+function findLongestWord(words) {
+  
+    if(words.length===0)return null;
 
+     let longestWord=words[0];
+    for(let i=1;i<words.length;i++){
+      if (words[i].length> longestWord.length){
+        longestWord= words[i];
+      }
+    }
+    return longestWord;
+  }
+ 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+  if(numbers.length ===0) return 0;
+  let sum=0;
+  for (let i=0;i<numbers.length;i++){
+   
+   sum+=numbers[i]; 
+  }
+  return sum;
+}
+
+
+
 
 
 
 // Iteration #3.1 Bonus:
-function sum() {}
+function sum(numbers) {
+  if(numbers.length === 0)return 0;
+  let sum=0;
+  for(let i=0;i<numbers.length;i++){
+    if(typeof numbers[i] == 'string')
+      sum += numbers[i].length;
+    else if(typeof numbers[i] == 'boolean'){
+      if(numbers[i])
+        sum += 1;
+    }
+    else if(typeof numbers[i]==='number')
+      sum += numbers[i];
+    else 
+        throw new Error('Unsupported data type sir or ma\'am');
+  }
+  return sum;
+}
+
+
 
 
 
@@ -26,16 +73,43 @@ function sum() {}
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(numbersAvg) {
+  if (numbersAvg.length=== 0) return null;
+  let sum=0;
+  for(let i=0;i<numbersAvg.length;i++){
+    sum+=numbersAvg[i];
+  }
+  const avg=sum/numbersAvg.length;
+  return avg;
+}
 
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(wordsArr) {
+  if(wordsArr.length===0)return null;
+  let totallength=0;
+  for ( let i=0; i<wordsArr.length;i++){
+    totallength+=wordsArr[i].length;
+  }
+  const avglength=totallength/wordsArr.length;
+  return avglength;
+
+
+}
+ 
+ 
+
+
 
 // Bonus - Iteration #4.1
-function avg() {}
+function avg(wordsArr) {
+  if(wordsArr.length == 0)
+    return null
+  return sum(wordsArr) / wordsArr.length;
+}
+
 
 // Iteration #5: Unique arrays
 const wordsUnique = [
@@ -52,14 +126,34 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+function uniquifyArray(wordsUnique) {
+  if(wordsUnique.length ===0)return null;
+  const uniqueWords=[];
+  for(let i=0;i<wordsUnique.length;i++){
+    if(!uniqueWords.includes(wordsUnique[i])){
+      uniqueWords.push(wordsUnique[i]);
+    }
+  }
+  return uniqueWords;
+}
+
+
 
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+function doesWordExist(wordsFind,findElement) {
+  if(wordsFind.length===0)return null;
+   for(let i=0;i<wordsFind.length;i++){
+    if(wordsFind[i]===findElement){
+      return true;
+    }
+   }
+   return false;
+}
+
 
 
 
@@ -78,8 +172,16 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
-
+function howManyTimes(wordsCount,wordToCount) {
+  if (wordsCount.length===0) return 0;
+  let count=0;
+  for(let i=0;i<wordsCount.length;i++){
+    if(wordsCount[i]===wordToCount){
+      count++;
+    }
+  }
+  return count;
+}
 
 
 // Iteration #8: Bonus
@@ -111,6 +213,7 @@ function greatestProduct() {}
 
 
 
+
 // The following is required to make unit tests work.
 /* Environment setup. Do not modify the below code. */
 if (typeof module !== 'undefined') {
diff --git a/tests/functions-and-arrays.spec.js b/tests/functions-and-arrays.spec.js
index 79a8158..513e756 100644
--- a/tests/functions-and-arrays.spec.js
+++ b/tests/functions-and-arrays.spec.js
@@ -280,7 +280,7 @@ describe('Count repetition', () => {
   });
 });
 
-describe('Bonus Quest - greatestProduct', () => {
+/*describe('Bonus Quest - greatestProduct', () => {
   test('should declare a function named greatestProduct', () => {
     expect(typeof greatestProduct).toBe('function');
   });
@@ -337,3 +337,4 @@ describe('Bonus Quest - greatestProduct', () => {
     expect(greatestProduct(matrix)).toBe(16);
   });
 });
+*/