Consider the following program fragment: (a)
int q = 0;
for (int i = 1; i < 11; i i. 2)
9 9 i;
System. out. print(a - 1);
)
The following two fragments were intended to produce the same output as fragment (ə);
(b)
int q = 0;
while (a < 11)
int i = 1;
99 + i;
ii + 2;
System. out. print(q - 1);
)
(0)
int a
int i;
do
99. i;
System. out. print(9 - 1);
) while (i (11);
Write down the output for each of the fragments (a), (b) and (c). Show your workings by, for example, providing a hand-tracing table.
Indicate how (b) and (c) could be modified (with as few changes as possible) so that the resulting code would produce the same output
as (a)

)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).

Write a program that prompts the user to input a string. the program then uses the function substr to remove all the vowels from the string. for example, if str = "there", then after removing all the vowels, str = "thr". after removing all the vowels, output the string. your program must contain a function to remove all the vowels and a function to determine whether a character is a vowel.

Which type of tab stop is most for weights and measurements?