(b) (2 points) Recall that n-pxq in an RSA cryptosystem. Specify for each of the following whether it is true or false. i. n is always odd- ii. ?(n)-(p-1) (q-1) is always even (c) (2 points) If a red black tree has n nodes, then its black height is e and its height is (d) (2 points) Upon insertion into a red black tree, what sequence of actions must happen for the tree's black height to increase? (e) (4 points) For each of the following, fill in the blank with the tightest time bound: i. (2 points) Given a binary search tree (balanced or not) of n nodes, the time taken to print the tree using an inorder traversal is ii. (2 points) If the binary search tree is balanced, then the time taken to print the tree using an inorder traversal is