PROLOG PRAMMING LANGUAGE

PLEASE DO THIS IN PROLOG PROGRAMMING LANGUAGE. This exercise is designed to help you practice arithmetic, decisions, and recursion in Prolog. Store your Prolog code in a file named nums (note: no file extension). 1. Write a Prolog predicate classify(+N, ?Classification): If N is bigger than 100, Classification should be the symbol big; if N is between 50 and 100 inclusive, Classification should be medium; and if N is smaller than 50, Classification should be small. For example, classify(24, X) should succeed with X = small, and classify(500, X) should succeed with X = big. 2. Write a Prolog predicate contains_big(+L) that takes a list L of numbers as an argument. The predicate should succeed if at least one of the numbers in the list is big (using the definition in problem #1), and should fail if none of the numbers in the list are big. Predicate contains_big should call predicate classifyfrom the previous problem to determine whether numbers are big. For example, contains_big([40, 692, 2, 800, 7])should succeed, and contains_big([2, 4, 6]) should fail.