Uniquely-accepting PDA for {aibjckd∣i=j}∪{aibjcke∣j=k}
Write a uniquely-accepting PDA (which cannot be deterministic)
recognizing the words of the form aibjckd with the same amount of a’s
and b’s, and of the form aibjcke with the same amount of b’s and
c’s.