2. Given a bunch of alphabet letter images of a given height and a scanned line of the same height, apply level building algorithm to arrive at the best recognition. In more detail, consider a string of the letters in our alphabet and spaces; we define the rendering of this string as concatenation of letter samples we have, and we take 1-pixel wide clean image as the sample of the space. The goal is to find a string whose rendering 1) has the same size as our input image and 2) is the closest point to our input image in the Euclidean space of images of this size. This is equivalent to finding the shortest path in a graph where each node is an inter-column position, and each arc is a possibility of inserting a sample between the positions.