Design a finite state machine that determines the least recently used number in a set. For this FSM, the set of numbers is (0, 1, or 2). For example, for the sequence 0, 1, 0, 2, 0, 2, where the left-most number is the first number to appear in the sequence, the least recently used number would be 1 because 0 and 2 were both used more recently than 1.

explanation:

i don't understand really? can u provide more information

u should make a machine that can make ice cream fresh!

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)

answer:

0.0

Explanation: