NOTE: You are NOT required to write a program for this problem.We wish to determine whether at least one three-of-a-kind exists ina hand of N cards, where a three-of-a-kind is three of the samevalue. Assume the cards have values 1 – 13. For example, the handwith card values {11, 5, 11, 5, 5} does have at least one
three-of-a-kind. For each of the following algorithms (A and B),find the simplified total Big-O run time as a function of thenumber of cards (N). Explain your answers based on each of thebulleted items and how they contribute to the total run time.
Algorithm A:
•
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured