QUESTION 1 Following is a simple program to add two integers. Write this code into MARS and answer the following
questions
data
num 1: word 54
num2: word 40
text
lw $so, num1
lw $s1 num2
add Ss2 S50, Ss1
li $v0,1
move Sa0,$s2
syscall
a. What is the address and size of num1 and num2?
b. What is the address of the instruction IwSs0, num 1
c. What is the machine code for instruction add Ss2 Ss0 Ss1
d. What is the purpose of instruction li Svo.1
e. Why do we need to use the instruction move Sa0. Ss2

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Farah works in an office with two other employees. all three share a printer and an internet connection. the utility that makes this possible is defragger quicktime soho winzip

Kto rozmawia z clamentain przez krótkofalówke w the walking dead w 4 epizodzie