Answer:her objetive is to impress the public with the poster.
Explanation:
The poster have to be about the music. It is very important for the singer or the festival.
The objetive is going on with the festival, with the music and with the concert’s style.
It’s a personal design. But it have to be original for every design.
Answer:Amino Acid
Explanation:
All proteins have amino acids
Answer:
THEUNITEDSTATESWASATPEACEWITHTHATNATIONANDATTHESOLIC ITATIONOFJAPANWASSTILLINCONVERsATIONWITHITSGOVERNMEN TANDITSEMPERORLOOKINGTOWARDTHEMAINTENANCEOFPEACEINTH EPACIFICINDEEDONEHOURAFTERJAPANESEAIRSQUADRONSHADCOM MENCEDBOMBINGINOAHUTHEJAPANESEAMBASSADORTOTHEUNITEDS TATESANDHISCOLLEAGUEDELIVEREDTOTHESECRETARYOFSTATEAF ORMALREPLYTOARECENTAMERICANMESSAGEWHILETHIsREPLYSTAT EDTHATITSEEMEDUSELESSTOCONTINUETHEEXIsTINGDIPLOMATIC NEGOTIATIONsITCONTAINEDNOTHREATORHINTOFWARORARMEDATTACK
Explanation:
Use this mapping:
abcdefghijklmnopqrstuvwxyz
kfazsrobcwdinuelthqgxvpjmy
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
