Task 1: "Write a script to print the Venus Symbol, international gender
symbol for women. Please feel free to use any character.

    ^^^^^
   ^     ^
  ^       ^
 ^         ^
 ^         ^
 ^         ^
 ^         ^
 ^         ^
  ^       ^
   ^     ^
    ^^^^^
      ^
      ^
      ^
    ^^^^^
      ^
      ^
"

My notes: sounds like a print statement to reproduce the given input.


Task 2: "Tug of War

You are given a set of $n integers (n1, n2, n3, ...).

Write a script to divide the set in two subsets of n/2 sizes each so
that the difference of the sum of two subsets is the least. If $n is
even then each subset must be of size $n/2 each. In case $n is odd then
one subset must be ($n-1)/2 and other must be ($n+1)/2.

Example

  Input:        Set = (10, 20, 30, 40, 50, 60, 70, 80, 90, 100)
  Output:  Subset 1 = (30, 40, 60, 70, 80)
           Subset 2 = (10, 20, 50, 90, 100)

  Input:        Set = (10, -15, 20, 30, -25, 0, 5, 40, -5)
           Subset 1 = (30, 0, 5, -5)
           Subset 2 = (10, -15, 20, -25, 40)
"

My notes: sounds like a "generate and test" problem.  Easy to do inefficiently,
	  challenging to try to make efficient.
	  Let's start by counting from 0 to 2^n-1 and using the bits
	  to select which subset to put each value into.