How many 3-digit natural numbers (without repetition of digits) are there such that each digit is odd and the number is divisible by 5?

The letters A, B, C, D and E are arranged in such a way that there are exactly two letters between A and E. How many such arrangements are possible?

A, B and C are three places such that there are three different roads from A to B, four different roads from B to C and three different roads from A to C. In how many different ways can one travel from A to C using these roads?

Let A, B and C represent distinct non-zero digits. Suppose x is the sum of all possible 3-digit numbers formed by A, B and C without repetition.

Consider the following statements :

1. The 4-digit least value of x is 1332.

2. The 3-digit greatest value of x is 888.

Which of the above statements is/are correct?