A Greedy algorithm iteratively makes one greedy choice after another, reducing each given problem into a smaller one

Which of the Red Black Tree Properties are violated on below Red Black Tree.  There may be more than one violation.  Assume every external node is black.

A Binomial Heap contains 3 binomial trees of degrees 10, 5, and 1.  How many elements does the heap contain? 

The Cook-Levin theorem was able to demonstrate that if the 3SAT problem can be solved in Polynomial Time, then at least all NP-Complete Problems don't belong to the P Class.

How Cook-Levin used the Boolean Satisfiability Problem in their research? (Select all that applies)

In the Branch and Bound approach we normally avoid evaluating subtrees that do not contain the solution, we are looking for.