Simplify the following Boolean functions to a minimum number of literals using k-maps, and draw the efficient circuit diagrams:

1. F(w, x, y, z) = (2, 3, 10, 11, 12, 13, 14, 15)
2. F(A, B, C, D) = (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)