Hábitos saludables e higiénicos. (3 points per answer.) Your host sister, Rosalía, is feeling better after following some of your advice. You decide to meet for coffee to catch up, since you’ve been so busy recently with your study abroad program. Rosalía is curious to learn more about different health and hygiene habits in the U.S. Answer her questions about what you and other people do to stay healthy in the U.S. Answer with a complete sentence and use the bolded verb from the question in your response.   ¿Te vacunas cada año para evitar la gripe? ¿Tus amigos se lavan las manos después de comer? ¿Tu familia se preocupa por tu salud?  ¿Tú y tus amigos se mantienen en forma por ir al gimnasio?   Written accents (for copying and pasting if needed): á é í ú ó ñ

Q2-b: Suppose that you are asked to select a data structure D that can support all of the following functions: 1. Search(D, x): Search for x in D, return true if x is present in D and false otherwise. 2. Insert(D, x): Insert x into the data structure D and update the data structure accordingly. 3. Delete(D, x): Delete x from the data structure D, given its address; and update the data structure accordingly. 4. Extract-Max(D): Delete and return the largest element in D; update the data structure accordingly. Assume that the candidate data structures are (i) Binary search tree (BST), (ii) Max-heap (HEAP), and (iii) Red-black tree (RBT). Note that a Max-heap is an array object, hence supports Search as well. Deletion in a Max-heap can be achieved by an IncreaseKey operation followed by an ExtractMax operation. Suppose that worst-case time complexity is the main concern, which of the above data structures would you select?

…is an operation that consists of combining the stem with a grammatical morpheme to give number for a noun, or time and person for a verb.

… involves identifying sequences of words which correspond to the speech signal captured by a microphone. 

….takes the point of view of the emitter and considers the way in which sounds are produced by the speech organs such as the pharynx, the tongue and the lips. 

The following figure shows red-black tree (RBT) in which a square denotes a black node, a circle denotes a red node, and the NIL nodes are omitted. The number inside a circle/square is the key value of the corresponding node. The label (upper-case letter) next to a node is a pointer pointing to the memory location of the corresponding node. You should use the label when referring to a node.   (a) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), the parent of O is [a]   (b) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), is O the left child of its parent or the right child of its parent? Write LEFT or RIGHT. [b]   (c) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). After BST insertion (before RBT insertion fixup), which property of the RBT is violated? Select 0 if none of the properties is violated. [c]   (d) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the parent of node E? [d]   (e) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the color of node J? [e]   (f) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the left child of node O? [f]   (g) Suppose that we want to insert 33 into the RBT in the figure. We first allocate memory for a tree node O and set its color to red and its key to 33. Then we insert it into tree T as if inserting into a binary search tree (BST). Then we perform insertion fixup if necessary. In the resulting RBT, what is the right child of node O? [g]     (h) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the right child of node A? [h]   (i) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node M? Write either BLACK or RED. [i]   (j) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the left child of node M? [j]   (k) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the right child of node M? [k]   (l) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node F? Write either BLACK or RED. [l]   (m) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node N? Write either BLACK or RED. [m]   (n) Suppose that we want to delete node C (with key=60) from the RBT  in the figure. In the resulting RBT, what is the color of node G? Write either BLACK or RED. [n]

…are languages (such as Vietnamese and Chinese) in which the morpheme-to-word ratio is very close to 1:1. 

….is the simplest form of morphological processing. It consists of returning inflected, derived or compound words to a canonical form, called the lemma, which is not necessarily a word or morpheme in the language.

¿Saber o conocer? It’s Friday evening and your Mexican host sister, Rosalía, has brought you along to her friend’s birthday party. You’re playing a game called “How well do you know me?” and it’s your turn. To play the game, you need to write six different statements about yourself, which the rest of the group will identify as truths or lies. Using the correct form of saber or conocer, complete each sentence below. Yo a un jugador de béisbol profesional. Mi padre Ciudad de México. Mi hermana y yo cocinar bien. Mi prima los nombres de todos los presidentes de Estados Unidos. Yo cuándo es tu cumpleaños. Mis tíos el arte de Picasso. Written accents (for copying and pasting if needed): á é í ú ó ñ

There are two sequences X= and Y=. You need to use the dynamic programming algorithm taught in class to compute a longest common subsequence (LCS) of X and Y. You need to compute the values of c(i, j) and b(i, j). Please note that I have used parentheses (rather than brackets) due to the Canvas syntax. Answer the following questions: (a) The value of c(5, 6) is [a]   (b) The value of c(4, 6) is [b]   (c) The value of c(3, 6) is [c]   (d) The value of c(2, 6) is [d]   (e) The value of c(1, 6) is [e]   (f) The value of c(5, 1) is [f]   (g) The value of c(5, 2) is [g]   (h) The value of c(5, 3) is [h]   (i) The value of c(5, 4) is [i]   (j) The value of c(5, 5) is [j]   (k) If the LCS is x followed by y followed by z, you should write it as . Note that the symbols are separated by a comma, and there is exactly one space after the comma. The LCS computed by the algorithm is [k]