diff --git a/src/adagrams.js b/src/adagrams.js
index 7ec5afc7..efbef5dc 100644
--- a/src/adagrams.js
+++ b/src/adagrams.js
@@ -1,15 +1,150 @@
+/*constructing a leeterpool object with letter as key and no. of times it can be drawn as value*/
+const LETTER_POOL = {
+  A: 9,
+  B: 2,
+  C: 2,
+  D: 4,
+  E: 12,
+  F: 2,
+  G: 3,
+  H: 2,
+  I: 9,
+  J: 1,
+  K: 1,
+  L: 4,
+  M: 2,
+  N: 6,
+  O: 8,
+  P: 2,
+  Q: 1,
+  R: 6,
+  S: 4,
+  T: 6,
+  U: 4,
+  V: 2,
+  W: 2,
+  X: 1,
+  Y: 2,
+  Z: 1,
+};
+
 export const drawLetters = () => {
   // Implement this method for wave 1
+  const drawnLetters = [];
+  //Evaluating total size of probable letters can be drawn
+  let totalSize = Object.values(LETTERPOOL).reduce((acc, val) => acc + val, 0);
+  let letterPoolArr = Object.entries(LETTERPOOL);
+  let count = 0;
+  let letterIdx;
+  const HAND_SIZE = 10;
+
+  while (drawnLetters.length < handSize) {
+    if (totalSize === 0) {
+      console.log('No more letters available to draw.');
+      break;
+    }
+
+    letterIdx = Math.random() * totalSize;
+    for (const [letter, frequency] of letterPoolArr) {
+      count += frequency;
+      if (letterIdx < count) {
+        drawnLetters.push(letter);
+        totalSize -= 1;
+        //updating array with already drawn letters
+        const updatedArr = letterPoolArr.map(([l, freq]) =>
+          l === letter ? [l, freq - 1] : [l, freq]
+        );
+        letterPoolArr = updatedArr.filter(([l, freq]) => freq > 0);
+        break;
+      }
+    }
+  }
+  return drawnLetters;
 };
 
 export const usesAvailableLetters = (input, lettersInHand) => {
   // Implement this method for wave 2
+  const letterObj = {};
+  for (let letter of lettersInHand.toUpperCase()) {
+    letterObj[letter] ? letterObj[letter]++ : (letterObj[letter] = 1);
+  }
+ //Utilizing object to track the letters drawn
+  for (let letter of input.toUpperCase()) {
+    if (letterObj[letter] === undefined || letterObj[letter] === 0)
+      return false;
+    else {
+      letterObj[letter] -= 1;
+    }
+  }
+  return true;
 };
 
 export const scoreWord = (word) => {
   // Implement this method for wave 3
+
+  const LETTER_SCORES = {
+    A: 1,
+    E: 1,
+    I: 1,
+    O: 1,
+    U: 1,
+    L: 1,
+    N: 1,
+    R: 1,
+    S: 1,
+    T: 1,
+    D: 2,
+    G: 2,
+    B: 3,
+    C: 3,
+    M: 3,
+    P: 3,
+    F: 4,
+    H: 4,
+    V: 4,
+    W: 4,
+    Y: 4,
+    K: 5,
+    J: 8,
+    X: 8,
+    Q: 10,
+    Z: 10,
+  };
+  word = word.toUpperCase();
+  let totalScore = 0;
+
+  for (let i = 0; i < word.length; i++) {
+    totalScore += LETTERSCORES[word[i]];
+  }
+  //Adding 8 bonus points for letters with length 7 to 10
+  const BONUS_POINTS = 8;
+  if (word.length >= 7 && word.length <= 10) {
+    totalScore += BONUS_POINTS;
+  }
+
+  return totalScore;
 };
 
 export const highestScoreFrom = (words) => {
   // Implement this method for wave 4
+  const wordScores = {};
+  let maxWord = '';
+  let maxScore = 0;
+  for (const word of words) {
+    wordScores[word] = scoreWord(word);
+  }
+  for (const [word, score] of Object.entries(wordScores)) {
+
+    if (score > maxScore) {
+      maxWord = word;
+      maxScore = score;
+    } else if (score === maxScore) {
+      //logic for words with score tied
+      if (word.length === 10 && maxWord.length !== 10) maxWord = word;
+      else if (word.length < maxWord.length && maxWord.length !== 10)
+        maxWord = word;
+    }
+  }
+
+  return { score: maxScore, word: maxWord };
 };
diff --git a/test/adagrams.test.js b/test/adagrams.test.js
index 1a0dc94e..bea3f3da 100644
--- a/test/adagrams.test.js
+++ b/test/adagrams.test.js
@@ -38,7 +38,6 @@ describe("Adagrams", () => {
   describe("drawLetters", () => {
     it("draws ten letters from the letter pool", () => {
       const drawn = drawLetters();
-
       expect(drawn).toHaveLength(10);
     });
 
@@ -120,7 +119,10 @@ describe("Adagrams", () => {
     });
 
     it("returns a score of 0 if given an empty input", () => {
-      throw "Complete test";
+      // throw "Complete test";
+      expectScores({
+        "": 0,
+      });
     });
 
     it("adds an extra 8 points if word is 7 or more characters long", () => {
@@ -133,7 +135,7 @@ describe("Adagrams", () => {
     });
   });
 
-  describe.skip("highestScoreFrom", () => {
+  describe("highestScoreFrom", () => {
     it("returns a hash that contains the word and score of best word in an array", () => {
       const words = ["X", "XX", "XXX", "XXXX"];
       const correct = { word: "XXXX", score: scoreWord("XXXX") };
@@ -145,7 +147,9 @@ describe("Adagrams", () => {
       const words = ["XXX", "XXXX", "X", "XX"];
       const correct = { word: "XXXX", score: scoreWord("XXXX") };
 
-      throw "Complete test by adding an assertion";
+      // throw "Complete test by adding an assertion";
+      expect(highestScoreFrom(words)).toEqual(correct);
+
     });
 
     describe("in case of tied score", () => {
diff --git a/test/demo/model.test.js b/test/demo/model.test.js
index 49bf9599..52ae8d23 100644
--- a/test/demo/model.test.js
+++ b/test/demo/model.test.js
@@ -1,7 +1,7 @@
 import Model from 'demo/model';
 import Adagrams from 'demo/adagrams';
 
-describe.skip('Game Model', () => {
+describe('Game Model', () => {
   const config = {
     players: [
       'Player A',