g Consider an array of n ticket prices, tickets. A number, m, is defined as the size of some subsequence, s, of tickets where each element covers an unbroken range of integers. That is to say, if you were to sort the elements in s, the absolute difference between any elements j and j + 1 would be either 0 or 1. Determine the maximum length of a subsequence chosen from the tickets array.

you have to email it to yourself from your phone then download it to either google drive or you computer files. then you can go to where ever you saved it and select it and then copy and paste it. or you could attach it to your question when you are writing it which would be much easier. for example: go to the attachment.

hmu if ur willing to do a algebra a online class i’ll pay 600 hmu on the gram profitpreme