  If every point in a normed space X admits a unique farthest point in a given
bounded subset E, then must E be a singleton?. This is known as the farthest
point problem. In an attempt to solve this problem, we give our contribution
toward solving it, in the positive direction, by proving that every such subset
E in the sequence space `1 is a singleton.
