Problem Statement  
We all know that a planar graph is one that you can draw without having any edges crossing. Perhaps less well known is that a planar graph can always be drawn with vertices on lattice points and with edges as straight lines between connected vertices. You will be given a String[], graph, representing a planar undirected graph, where the j^{th} character of element i of graph indicates whether vertices i and j are connected ('T' for true, 'F' for false). Your task is to find the area of the smallest rectangular box that the vertices can be placed in so that they are located on lattice points with nonoverlapping straight edges between connected vertices.  
Definition  
 
Notes  
  Lattice points are ones with integer coordinates.  
Constraints  
  graph will contain between 1 and 7 elements, inclusive.  
  Each element of graph will contain the same number of characters as there are elements in graph.  
  Each character in graph will be 'T' or 'F'.  
  Character i in element i of graph will be 'F'.  
  Character i in element j of graph will be equal to character j in element i.  
  The graph will be planar.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
