According to Cialdini, when a salesperson approaches people and asks, “How are you doing today?” and waits for a response, the explanation for the tactic is that

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): á é í ú ó ñ

… consists of combining the stem with a grammatical morpheme.

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

Match the following terms with the MOST correct definition.  There are “red herrings” included in the list.

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

…is a branch of linguistics that focuses on the way in which words are formed from morphemes. 

…is one of two or more complementary morphs which manifest a morpheme in its phonological or morphological environments.

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   (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.   (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.   (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?   (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?   (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?   (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?     (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?   (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.   (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?   (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?   (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.   (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.   (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.

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