Solve this question using JAVA

CodeVIT a https://vit162.examly.io/session T Presentation OMANT 1 TacticCTCOTOJ 29:47 Unattempted 1 0 Attempted Bookmarked 0 Attempted & Bookmarked 0 Program 1 Speed GRE VIT Program 1 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Study Conference Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police. The first number n denotes the number of houses which is followed by the values of money in each house is denoted by k Constraints: 29:47 1. 1