In problem2.jff, build a deterministic finite-state machine that accepts all bit strings in which the first and last bits are the same, and that rejects all other bit strings. it should notaccept the empty string.

this problem requires at least five states. you may use more states if necessary (there’s no penalty for doing so), but if you have time, try to get as close to the minimum as possible!
here are three examples of strings that should be accepted:

01010
1
11101
here are three strings that should be rejected:
01
0010011
0

In a heat transfer course, we can derive the equation for the temperature distribution in a flat rectangular plate. in this example, we will look at a plate at steadystate with three sides being held at t1, and one side held at t2. the temperature for any location on the plate, t(x,y), can be calculated by where create a function (prob3_5) that will take inputs of vectors x and y in feet, scalar n, scalars l and w in feet and scalars t1 and t2 in degrees fahrenheit. it will output a matrix t which is the temperature of each x and y locations. t will have the number of columns equal to the number of elements in x and rows equal to the number of elements in y. though this can be done without loops (perhaps more efficiently), your program must use a nested loop.