The function negl3(n) = negl1(n) + negl2(n) is negligible.” What can you say about the function negl6(n) = negl4(n) – negl5(n)?

Find a regular expression for L = {ab"w: n2 3, w e {a, b}*}.

Write a recursive Racket function "update-if" that takes two functions, f and g, and a list xs as parameters and evaluates to a list. f will be a function that takes one parameter and evaluates true or false. g will be a function that takes one parameter and evaluates to some output. The result of update-if should be a list of items such that if x is in xs and (f x) is true, then (g x) is in the list. The output list's elements should keep the input list's items in the same relative order. For example (update-if even? add1 '(1 2 3 4)) should evaluate to '(3 5) because 2 and 4 make even? true and add1 turns 2 and 4 into 3 and 5.

Describe an efficient way of putting a VECTOR rep­resenting a deck of n cards into random order in C++. You may use the function randomlnt(n), which returns a random number between 0 and n-1, inclusive. Your method should guarantee that every possible ordering is equally likely. What is the run­ning time of your function?

What is the a(3) term of the sequence {a(n)} where a(n) = 2n - 6?