Question

you are given with a string s of length n. you have to sort the string s in such a way that when individual characters are converted to their ascii values, they should follow given rules : characters possessing prime ascii value should come before character possessing composite ascii value. if two characters are having prime ascii value, character having less ascii should come before other. if two characters are having composite ascii value, character having greater ascii value should come before other. input format the first line of input contains the length of string s. the second line of input contains string s. output format the single line of output should contain required modified string. constraints time limit: 1 memory limit: 256 source limit: explanation for primes : a < k for composite : k < h < i < j < n < o < r < u adding up logic , required answer is akkurthi​

Answer 1

Answer:

hii dear

how are you

what's your name kya app meri friend banogi

Explanation:

please mark as brainliest

please follow me you follow me I also follow you

Answer 2

Answer:

ooooooooooooooooooooooooooooooooooo

Explanation:

ooooooooooooooooooooooooooooooooooo