Problem #PRU-100334

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

A snail climbs a 10-meter high tree. In day time the snail manages to climb 4 meters, but slips down 3 meters during the night time. How long would it take the snail to reach the top of the tree if it started the journey on a Monday morning?