A group of monkeys are collecting bananas in a jungle. As illustrated below, the jungle is represented by a 3x4 2D array called JUNGLE where each element contains a certain number of bananas. The monkeys collect bananas starting from the top left corner through to the bottom right corner of the jungle. The monkeys can only move right or down at any point in time. Construct an algorithm to output the maximum number of bananas the monkeys can collect.