Read the passage below and solve the questions based on it.
There are three bottles of water- A, B and C whose capacities are 5 litres, 3 litres and 2 litres respectively. For transferring water from one bottle to another and to drain out the bottles, there exists a programe which is computer-controlled. The computer that controls the flow through these pipes can be fed with three types of instructions, as explained below:
Initially, A full of water and B and C are empty.
Initially, A had 5 litres, B had 2 litres and C had 1 litre. What is the minimum number of times Fill (x, y) is required to be used so that A is empty, provided we can not use Empty (x, y) instruction?