The following C-like code calculates the maximum difference between any two unsigned numbers within an array A consisting of 256 8-bit values. Complete the HLSM for the code. (Answers are case sensitive) Inputs: byte a[256], bit go Outputs: byte max_diff, bit done MAX_DIFF: while(1) { while(!go); done = 0; i = 0; max = 0; min = 255; // largest 8-bit value while( i < 256 ) { if( a[i] < min ) { min = a[i]; } if( a[i] > max ) { max = a[i]; } i = i + 1; } max_diff = max - min; done = 1; }

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below