Information gain calculation for decision tree

I am having trouble figuring out how to calculate information gain in decision trees. Suppose a decision tree node splits the data of 5 red and 5 black balls into 2 branches: 4 reds in the right child node and 5 blacks and one red in the left child node. What is the information gain in this split?