![Wordle is a popular online word game called Wordle. There are instructions given at the official site for Wordle, but essentially, it is a word guessing game. In this game, each guess is marked by indicating which letters of your guess match a secret answer. A Green mark indicates that you have found a correct letter in the correct position in the secret word. A Yellow mark indicates that you have found a correct letter but in an incorrect position relative to the secret word. A Grey mark indicates that the given letter does not appear in the secret word at all. Be careful of duplicate letters: a letter that is guessed twice may be marked once as Green or Yellow and once as Grey if there is only a single occurrence of that letter in the secret word. In particular, Green markings take priority over Yellow markings, and Yellow markings have a priority in the guess, reading from Left to Right. Given the datatypes dataCheck = GreenYellowGrey deriving (Eq, Show, Read), typeMarking = [(Char, Check)], write a function markGuess :: String -> String -> Marking that takes the secret word to be guessed and a guess of the same length. The function should return a marking according to the Wordle rules. The order of the returned marking matters and should satisfy map fst (markGuess secret guess) == guess. An example marking showing the marking priorities is markGuess "aaabb" "bbxxb" should return [(b, Yellow), (b, Grey), (x, Grey), (x, Grey), (b, Green)]. The final 'b' in the guess is marked Green because it is correctly placed in the secret word. The first 'b' in the guess is marked Yellow because there is a second occurrence of 'b' in the secret word in a different position. The second 'b' in the guess is marked Grey because there is no third occurrence of 'b' in the secret word. Note that your solution should work with strings of any length but should report an error where the two given strings are of different lengths. Hint: A reasonable strategy is to write a helper function that finds the characters marked Green first. Then feed the result of that helper function into another helper function that finds the Yellow markings.](https://gotit-pro.com/wp-content/uploads/2023/10/20e3b46d-d1f9-447e-bb76-76edd25bf950.png "Wordle is a popular online word game Wordle There are instructions given at the official site for")
Description
Wordle is a popular online word game called Wordle. There are instructions given at the official site for Wordle, but essentially, it is a word guessing game. In this game, each guess is marked by indicating which letters of your guess match a secret answer.
A Green mark indicates that you have found a correct letter in the correct position in the secret word. A Yellow mark indicates that you have found a correct letter but in an incorrect position relative to the secret word. A Grey mark indicates that the given letter does not appear in the secret word at all.
Be careful of duplicate letters: a letter that is guessed twice may be marked once as Green or Yellow and once as Grey if there is only a single occurrence of that letter in the secret word. In particular, Green markings take priority over Yellow markings, and Yellow markings have a priority in the guess, reading from Left to Right.
Given the datatypes dataCheck = GreenYellowGrey deriving (Eq, Show, Read), typeMarking = [(Char, Check)], write a function markGuess :: String -> String -> Marking that takes the secret word to be guessed and a guess of the same length. The function should return a marking according to the Wordle rules. The order of the returned marking matters and should satisfy map fst (markGuess secret guess) == guess.
An example marking showing the marking priorities is markGuess “aaabb” “bbxxb” should return [(b, Yellow), (b, Grey), (x, Grey), (x, Grey), (b, Green)]. The final ‘b’ in the guess is marked Green because it is correctly placed in the secret word. The first ‘b’ in the guess is marked Yellow because there is a second occurrence of ‘b’ in the secret word in a different position. The second ‘b’ in the guess is marked Grey because there is no third occurrence of ‘b’ in the secret word.
Note that your solution should work with strings of any length but should report an error where the two given strings are of different lengths.
Hint: A reasonable strategy is to write a helper function that finds the characters marked Green first. Then feed the result of that helper function into another helper function that finds the Yellow markings.
![1. Write a program in MARIE assembly language to perform the following code segment. Test your code thoroughly using the MARIE simulator with values of X=10, X=20, and X=30. What is the value stored in X and Y by the end of execution? Include comments for each line of instruction in your program (12 points). X=10 Y=0 while X!=0 do Y=X X=X-1 endwhile while X!=0 do Y=X X=X-1 endwhile 2. Consider the following program in MARIE assembly language. Complete the table detailing the RTN for the next 3 instructions only that will be executed including the content of registers PC, IR, MAR, MBR, and AC in hexadecimal. Note the first instruction LOAD X is already filled. Note also that the SKIPCOND instruction has no operands, therefore you can complete Fetch, decode and execute cycles only. Explain in one statement what this program is doing (14 points). ORG 000 LOAD X ; AC = X Repeat, ADD One ; AC = X + 1 SKIPCOND 000 ; if AC < 0 then PC = PC + 1 (skip) JUMP End ; Go to End STORE X ; X = AC JUMP Repeat ; Go to Repeat End, STORE X ; Stop (end of program) This program is incrementing the value of X by 1 repeatedly until the value in AC becomes negative. 3. Assume a main memory has the following hex values in the first two bytes: Byte 0: 8F Byte 1: 0F What is the actual decimal value stored in these bytes, assuming they are in 16-bit 2's complement representation and the machine is using: a) Big endian memory b) Little endian memory (4 points) a) In big endian memory, the byte order is reversed. So, the actual decimal value stored in these bytes would be -7. b) In little endian memory, the byte order remains the same. So, the actual decimal value stored in these bytes would be 36655. 4. Consider the assembly program (in MARIE) below and the corresponding memory address for each instruction. Show the symbol table that will be constructed by the assembler after the first pass including the translated program, then fill in the final machine code produced by the assembler after the second pass. Fill in the given tables using HEX numbers for instructions and addresses. (10 points) [Symbol Table] LOAD 0100 ADD 0101 STORE 0110 SUBT 0111 JUMP 1000 Dec1 0001 [First Pass] 0100 LOAD X ; Load value at address X to AC 0101 ADD Y ; Add value at address Y to AC 0110 STORE Z ; Store value in AC to address Z 0111 SUBT X ; Subtract value at address X from AC 1000 JUMP Z ; Jump to address Z [Second Pass] 0100 1005 ; Load X 0101 5006 ; Add Y 0110 210B ; Store Z 0111 1015 ; Subtract X 1000 4010 ; Jump Z](https://gotit-pro.com/wp-content/uploads/2023/10/fa03249e-78f5-4de9-8ddf-1a7a5999f6df.jpg)
![Emergency Response Planning You are responsible for planning emergency response routes for a city. The city is represented as a graph, with intersections as nodes and roads as edges. In the event of an emergency, you need to find the shortest path from a central emergency command center to various locations in the city to minimize response time. The city's road network is represented as an undirected weighted graph, where each road has a known travel time (weight) associated with it. Your task is to find the shortest paths from the central emergency command center (Node F) to all other intersections in the city. Your code should return a nested list of [Source, Target, Duration]. Example: [[F, C, 2]]](https://gotit-pro.com/wp-content/uploads/2023/10/c150e24f-eb6a-4e13-a47f-5bc50d4fda18.jpg)
Bob Salerno –
Tutor is patient, highly efficient and well spoken. I can always count on early delivery! Thx!!
Patrick Lorenz –
It was amazing work and in a very short time.