Create a MIPS program that fulfills the following specifications: 1. use the dialog syscall (#54) to input a string from the user 2. call a function which counts the number of characters and number of words in the string and returns these in $v0 and $v1; store these in memory 3. output (console) the string and counts to the user (see example below) 4. repeat from 1 until the user enters a blank string or hits "cancel" 5. additionally, use $s1 somewhere in your function so that you must save it on the stack at the top of your function and restore it before the function exits; Of course this function could be written without using an s register, but this is good practice in using the stack. 6. output a dialog message (syscall #59) to say goodbye before the program ends

To display data in a certain manner like alphabetical order is called

This problem has been solved! see the answeran evil king has a cellar containing n bottles of expensive wine, and his guards have just caught a spy trying to poison the king’s wine. fortunately, the guards caught the spy after he succeeded in poisoning only one bottle. unfortunately, they don’t know which one. to make matters worse, the poison the spy used was very deadly; just one drop diluted even a billion to one will still kill someone. even so, the poison works slowly; it takes a full month for the person to die. design a scheme that allows the evil king to determine exactly which one of his wine bottles was poisoned in just one month’s time while expending at most o(logn) of his taste testers.you are not allowed to use n testers, one for each bottle, and see which one tester dies after 30 days.(no pseudocode needed. just answer in words, how many testers you use, how you use them and why you correctly identify the poisoned bottle in 30 days)

According to alisa miller foreign news bureaus