Dylan and Frank have designed a compression algorithm used for directions to unknown locations. In their algorithm the direction to travel at each intersection encountered is replaced with a single letter: "E" for East, "W" for West, "N" for North and "S" for South. In addition, the string "EEE" is replaced with "A" and "SSS" is replaced with "D". Which of the following best describes the directions which are expressed as "NASSA" when compressed using Dylan and Frank’s algorithm?

The directions followed for each intersection in order are North, 3 times East, 2 times South

and 3 times East.

Step-by-step explanation:

For the word NASSA in their algorithm we know the direction they take in the first intersection is North (N).

The second letter is A = EEE, which means in the 3 next intersections they follow the East.

The two Ss indicate they follow South in the next 2 intersections.

And finally, they follow the East in the last 3 intersections.

Their direction choices can be summarized in North-East-East-East-South-South-East-East-East.

you have to put the graph on here with the question

step-by-step explanation: