Task: Question Decomposition
Input (English): question: find the name of driver who is driving the school bus with the longest working history.
Output (English): #1 return drivers 
#2 return #1 driving the  school bus 
#3 return working history of  #2 
#4 return #2 where #3 is  longest 
#5 return name of  #4