Write a predicate named split 3(N, L) that has two arguments: N, a positive integer, and L, a list of positive integers. You may assume that the list L is flat, i. e., it does not contain sublists, and that both N and L are instantiated (i. e. neither are variables).The predicate split 3/2 returns true (or yes) if the list L can be partitioned into three sublists (with elements in the same order), such that the sum of the integers in each subset is less than or equal to N. Otherwise, it returns false (or no)