Given an array of car prices, a target price and a number k, return the k car prices closest to the target.
Asked in the coding interview stage. Return the selected prices in ascending order. If the target is absent and k is greater than 1 and odd, consider the target as an eligible price point before selecting the closest values.
Implement closest_car_prices(prices, target, k). Inputs are a list of integers and two integers. Return a list of exactly k integers.
def closest_car_prices(prices, target, k):