<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def analyze_overs(self):
 """A helper function to prepare values describing overlaps"""

      #check for full overlap first
      self.dif1 = [self.overs[i][0]-self.overs[i-1][0] for i in range(1,len(self.overs))]
      self.dif2 = [self.overs[i][1]-self.overs[i-1][1] for i in range(1,len(self.overs))]
      #see if it starts and ends on first or last junction
      self.start1 = self.overs[0][0] == 0
      self.start2 = self.overs[0][1] == 0
      self.end1 = self.overs[-1][0] == len(self.j1)-1
      self.end2 = self.overs[-1][1] == len(self.j2)-1
      return