There is another way to get this solved. This method can be generalized to solve such kind of problems.

The steps are:

1. Take a specific case that satisfies the given condition.

2. Find the possible arrangements for that case.

3. Find the number of such cases.

Let me elaborate with the solution.

1. We can choose any two positions out of the 5 positions. Say i choose a specific case where Jen is 1st & Bob is 4th.

J _ _ B _

2. The three blank spaces can be filled in 3! ways.

3. Now 2 positions can be selected from 5 positions ( as done in step 1 ) in 5C2 ways

So, total ways: 3! * 5C2 = 60

_________________

I do not suffer from insanity. I enjoy every minute of it.