Computer Science, asked by vellankitejaswini, 21 days ago

2
There are two towns A and B respectively. Both the
towns are organizing an
international trade
festival. Initially, you have n bitcoins. Now, as you
are fond of trading, firstly you decide to go to town
A and participate in some finite number of the
trade process. Then you decide to go to town B
and participate in some finite number of trade
processes in town B and finally, you return again to
town A and participate in some finite number of
the trade processes.
Light
A trade process in town x={A, B} can be one
among the following (any number of times in any
order) -
Ili​

Answers

Answered by kusumlatalatakusum5
0

Answer:

I dont know sorry you can take help of gebious

Similar questions