It would be the army and then people of nyc
Answer: 1 what do u think to help u
Answer:
K1 ⊕ K2 = 9
Explanation:
Since 5 ⊕ K = 12, K must be 5 ⊕ 12 = 9.
But there are supposedly two encryptionkeys, we cannot know their individual value, only that K1 ⊕ K2 = 9.
That makes this a bit weird question.
<h2>This function will land up in infinite function call</h2>
Explanation:
first time when the function gets invoked,
f(6,8), so k=6 & n=8, inside the function it checks k==n, ie. 6==8, returns false, then one more if is available, so 6>8 is check for , once again it is false and else loop is executed, the function is called recursively using f(k-n,n), that is f(6-8,8), it means f(-2,8) is passed.
Second time,
if(-2==8) is false, so if(-2>8) is again false and function f(-10, 8) is called
if(-10==8) is false, so if(-10>8) is again false and function f(-18,8) is called
if(-18==8) is false, so if(-18>8) is again false and function f(-26,8) is called
So this goes recursively and ends in an infinite function call.
