<h2>Many properties can be listed out viz. durability, quality, the sound that it produces also depends on the material that is used, etc.</h2>
Explanation:
1. If you take wood then I would say maple, rosewood, cedar, walnut can be used to make "String instruments".
Reason:
The wood that we choose should be perfect and should give long-life to use the instrument.
2. If we consider about strings, then I would suggest that the material that you choose should be "ductile and hard".
Reason:
Thin wires can be drawn.
3. In case of Brass, it should be "malleable metal", so that the outcome of the instrument will satisfy the need.
B. Internet Telephony would be my best guess. I'm not that good with computers. Hope this Helps :-)
Answer:humans need energy to complete the regular body requirements to digest our food,to breathe,to move,to run,to travel and continue the metabolism of our regular life.
Explanation:energy is essential to life and all living thing organisms.
Yes you have to do that so people recognize u but not for all social media unless ur talking bout Facebook, Twitter, kik,and I can't think of anything else. At the moment I know lots more just can't think bout it right now
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find
, we need to compute
and
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.