Prove that if a deterministic finite automata with exactly 5 states accepts a string of length 6, it must also accept some string of size less than 6.

There’s also the option of making a new one

Cprogram to find //perimeter of rectangle printf(" \n perimeter of rectangle \n"); printf(""); printf("\n enter width and length of the rectangle : "); scanf("%f%f", & width,& length); perimeter = 2 * (width + length); printf("perimeter of rectangle is: %.3f", perimeter);  

Answerair gap;