Each of the football teams Istanbulspor, Yesildirek, Vefa, Karagumruk, and Adalet, played exactly one match against the other four teams. Istanbulspor defeated all teams except Yesildirek; Yesildirek defeated Istanbulspor but lost to all the other teams. Vefa defeated all except Istanbulspor. The winner of the game Karagumruk-Adalet is Karagumruk. In how many ways one can order these five teams such that each team except the last, defeated the next team?

$ 
\textbf{(A)}\ 5
\qquad\textbf{(B)}\ 7
\qquad\textbf{(C)}\ 8
\qquad\textbf{(D)}\ 9
\qquad\textbf{(E)}\ \text{None of the preceding}
$
To solve this problem, we need to determine the number of ways to order the five football teams such that each team, except the last, defeated the next team. Let's denote the teams as follows:
- \( I \) for Istanbulspor
- \( Y \) for Yesildirek
- \( V \) for Vefa
- \( K \) for Karagumruk
- \( A \) for Adalet

From the problem statement, we have the following results:
1. Istanbulspor (\( I \)) defeated all teams except Yesildirek (\( Y \)).
2. Yesildirek (\( Y \)) defeated Istanbulspor (\( I \)) but lost to all the other teams.
3. Vefa (\( V \)) defeated all except Istanbulspor (\( I \)).
4. Karagumruk (\( K \)) defeated Adalet (\( A \)).

We need to find the order such that each team, except the last, defeated the next team. Let's analyze the possible orders step by step.

1. **Determine the relative positions of \( I \) and \( Y \):**
   - Since \( I \) defeated all except \( Y \), \( I \) must be placed before \( Y \).

2. **Determine the relative positions of \( V \) and \( I \):**
   - Since \( V \) defeated all except \( I \), \( V \) must be placed before \( I \).

3. **Determine the relative positions of \( K \) and \( A \):**
   - Since \( K \) defeated \( A \), \( K \) must be placed before \( A \).

4. **Combine the constraints:**
   - \( V \) must be before \( I \).
   - \( I \) must be before \( Y \).
   - \( K \) must be before \( A \).

Let's list the possible orders that satisfy these constraints:

- \( V \) must be before \( I \) and \( I \) must be before \( Y \). This gives us the sequence \( V \rightarrow I \rightarrow Y \).
- \( K \) must be before \( A \).

We need to place \( K \) and \( A \) in the sequence \( V \rightarrow I \rightarrow Y \) such that the order is maintained. We have the following possibilities:

1. \( V \rightarrow I \rightarrow K \rightarrow A \rightarrow Y \)
2. \( V \rightarrow K \rightarrow I \rightarrow A \rightarrow Y \)
3. \( V \rightarrow K \rightarrow A \rightarrow I \rightarrow Y \)
4. \( K \rightarrow V \rightarrow I \rightarrow A \rightarrow Y \)
5. \( K \rightarrow V \rightarrow A \rightarrow I \rightarrow Y \)
6. \( K \rightarrow A \rightarrow V \rightarrow I \rightarrow Y \)

Additionally, we need to consider the possibility of \( Y \) being at the end:

7. \( V \rightarrow I \rightarrow K \rightarrow Y \rightarrow A \)
8. \( V \rightarrow K \rightarrow I \rightarrow Y \rightarrow A \)
9. \( K \rightarrow V \rightarrow I \rightarrow Y \rightarrow A \)

Thus, there are 9 possible ways to order these five teams such that each team, except the last, defeated the next team.

The final answer is \( \boxed{9} \)